Problem:
 Score : 200 points    Problem Statement You are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.      Constraints  2 ≤ |S| ≤ 26 , where |S| denotes the length of S .  S consists of lowercase English letters.         Input Input is given from Standard Input in the following format:  S       Output If all the characters in S are different, print yes (case-sensitive); otherwise, print no .        Sample Input 1 uncopyrightable      Sample Output 1 yes       Sample Input 2 different      Sample Output 2 no       Sample Input 3 no      Sample Output 3 yes

Solution (Python):
s=input()
t="yes"
for i in s:
    if s.count(i)>1:
        t="no"

print(t)

Solution (Python):
s=input()
if len(set(s))==len(s):
  print("yes")
else:
  print("no")

Solution (Python):
s=input()
sdic={}
flag=False
for i in range(len(s)):
  if(s[i] in sdic):
    flag=True
    break
  else:
    sdic[s[i]]=1
if(flag):
  print("no")
else:
  print("yes")

Solution (Python):
s=input();print('yes'if len(s)==len(set(s))else'no')

Solution (Python):
s=input()
print(['yes','no'][len(set(s)) != len(s)])

Solution (Python):
s = input()
distinct = set(s)
  
print("yes" if len(s) == len(distinct) else "no")

Solution (Python):
s = input()
length = len(s)
if len(set(s)) == length:
    print('yes')
else:
    print('no')

Solution (Python):
S = input()

for i in range(len(S)):
    if S.count(S[i]) >= 2:
        print("no")
        exit()

print("yes")

Solution (Python):
S = list(input())

S.sort()

for i in range(len(S) - 1):
    if S[i] == S[i + 1]:
        print("no")
        exit()

print("yes")

Solution (Python):
S = input()

alpha = "abcdefghijklmnopqrstuvwxyz"
c = [0] * 26

for i in range(len(S)):
    for j in range(26):
        if S[i] == alpha[j]:
            c[j] += 1

if max(c) <= 1:
    print("yes")
else:
    print("no")

Solution (Python):
s = input()
n = len(s)
a = set(s)
if len(a) == n:
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
print('yes' if len(s)==len(list(set(s))) else 'no')

Solution (Python):
s = list(input())
S = set(s)
if len(s) != len(S):
    print("no")
else:
    print("yes")

Solution (Python):
S = input()
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
if len(s) == len(list(set(s))):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
print("no" if len(s) - len(set(s)) else "yes")

Solution (Python):
import collections
s = list(input())
print("yes" if len(s) == len(collections.Counter(s).keys()) else "no")

Solution (Python):
S = input()
C = set()
for s in S:
    if s in C:
        print("no")
        break
    C.add(s)
else:
    print("yes")

Solution (Python):
s = list(input())
print('yes' if len(s)==len(set(s)) else 'no')

Solution (Python):
s=input()
print("yes" if len(s)==len(set(s)) else "no")

Solution (Python):
s = list(input())

if len(s) == len(set(s)):
  print('yes')
else:
  print('no')

Solution (Python):
s = list(input())

if len(s) == len(list(set(s))):
  print('yes')
else:
  print('no')

Solution (Python):
s = input()
cnt = 0

for i in range(len(s)):
  if s.count(s[i]) == 1:
    cnt = cnt
  else :
    cnt = cnt +1

if cnt >= 1:
  print('no')
else:
  print('yes')

Solution (Python):
s=input()
if len(s)==len(set(s)):
    print("yes")
else:
    print("no")

Solution (Python):

s = input()
print('yes' if len(s) == len(set(s)) else 'no')

Solution (Python):
s = input()

d = {}
for i in range(len(s)):
    if s[i] in d:
        print('no')
        exit()
    d[s[i]] = True
print('yes')

Solution (Python):
s = input()
sset = set(s)

if len(s) == len(sset):
  print("yes")
else:
  print("no")

Solution (Python):
s=input()
print("no" if len(s)-len(set(s)) else "yes")

Solution (Python):
S = input()
N = len(S)
set_S = set(S)
if N == len(set_S):
  print('yes')
else:
  print('no')

Solution (Python):
s = input()

print('yes' if len(s) == len(set(s)) else 'no')

Solution (Python):
s = list(input())
s_set = set(s)
if len(s)==len(s_set):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
print("yes" if len(s)==len(list(set(s))) else "no")

Solution (Python):
S = input()
print ("yes" if len(S) == len(set(S)) else "no")

Solution (Python):
S = input()
print("yes" if len(S)==len(set(S)) else "no")

Solution (Python):
s = input()
print("yes" if len(s) == len(set(s)) else "no")

Solution (Python):

import sys
INF = float("inf")


def yes():
    print("yes")  


def no():
    print("no")  


def solve(S: str):
    S = list(S)
    S.sort()
    for i in range(len(S)-1):
        if S[i] == S[i+1]:
            no()
            return
    yes()
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)


if __name__ == '__main__':
    main()

Solution (Python):
s = str(input())
if len(s)==len(set(s)):
    ans = "yes"
else:
    ans = "no"
print(ans)

Solution (Python):
import collections
s = input()
c = collections.Counter(s)
if c.most_common()[0][1] == 1:
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
print(["no","yes"][len(s)==len(set(s))])

Solution (Python):
S = input()
s = set()
for i in range(len(S)):
    s.add(S[i])
if len(s) == len(S):
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
S=set(s)
if len(s)==len(S): 
    print("yes")
else: 
    print("no")

Solution (Python):
import sys
input = sys.stdin.readline

S = input()
T = sorted(S)
for i in range(1, len(T)) :
    if T[i] == T[i-1] :
        print('no')
        break
else :
    print('yes')

Solution (Python):
s = input()
n = len(s)
pool = set()
for i in range(n):
  pool.add(s[i])
if len(pool) == n:
  print('yes')
else:
  print('no')

Solution (Python):

s = list(input())
print('yes' if len(s) == len(set(s)) else 'no')

Solution (Python):
s = input()
print('yes' if len(s) == len(set(s)) else 'no')

Solution (Python):
s=input()
if len(s)==len(set(s)):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
if len(s) == len(set(s)):
  print('yes')
else :
  print('no')

Solution (Python):
import sys
input=sys.stdin.readline

s = input()
if len(s) == len(set(sorted(s))):
    print("yes")
else:
    print("no")

Solution (Python):
s = input()

if len(s) == len(set(s)):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
lens = len(s)
lenss = len(set(s))
if lens == lenss:
    print("yes")
else:
    print("no")

Solution (Python):
s = input()
d = {}
for i in range(len(s)):
    d[s[i]] = 1
if len(s) == len(d):
    print("yes")
else:
    print("no")

Solution (Python):
s = input()

ans = "yes"
for i in range(len(s)):
    if s.count(s[i])>1:
        ans = "no"

print(ans)

Solution (Python):
s = input()
for i in range(len(s)):
  if s.count(s[i]) >=2:
    print('no')
    exit()
print('yes')

Solution (Python):
s=list(input())
if len(set(s))==len(list(s)):
  print('yes')
  
else:print('no')

Solution (Python):
s=input()
g=set(s)
if len(s)==len(g):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
m = list(set(s))
print('yes') if len(s) == len(m) else print('no')

Solution (Python):
s=list(input())
if len(s)==len(set(s)):
  print('yes')
else:
  print('no')

Solution (Python):
s = input()
ans = 'yes'
if len(set(s)) != len(s):
    ans = 'no'
print(ans)

Solution (Python):
S = list(input())
A = S.copy()
A = set(A)
print("yes") if len(S) == len(A) else print("no")

Solution (Python):
S=input()
if len(S)==len(set(list(S))):
  print('yes')
else:
  print('no')

Solution (Python):
s=input()
a=[]
for i in range(len(s)):
	if s[i] in a:
		print("no")
		exit()
	a.append(s[i])
print("yes")

Solution (Python):
s = input()
a = {}
for c in s:
  if c not in a:
    a[c] =1
  else :
    print('no')
    break
else:
  print('yes')

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
import random
 




 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    S = list(input())
    
    tmp = {}
    for i in S:
        if i in tmp:
            print("no")
            sys.exit()
        else:
            tmp[i] = 1
            
    print("yes")
        
if __name__ == "__main__":
	main()

Solution (Python):
s=list(input())
print('yes' if len(s)==len(list(set(s))) else "no")

Solution (Python):
s = input()
count = 0
for i in range(len(s)):
  for j in range(i+1,len(s)):
    if s[i] != s[j]:
      count += 1
if count == sum(range(1,len(s))):
  print("yes")
else:
  print("no")

Solution (Python):
import sys
S = input()
for i in range(len(S)):
    if S.count(S[i]) >= 2:
        print('no')
        sys.exit()

print('yes')

Solution (Python):

from collections import Counter

S = Counter(list(input())).most_common()
if all([value == 1 for key, value in S]):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
ans = 'yes'
for char in s:
  if s.count(char) > 1:
    ans = 'no'
print(ans)

Solution (Python):
s = list(input())
print("yes" if len(set(s)) == len(s) else "no")

Solution (Python):
S = input()
for idx, char in enumerate(S):
  if idx == len(S)-1:
    break
  if char in S[idx+1:]:
    print('no')
    exit()
print('yes')

Solution (Python):
S = input()
print("yes" if len(S) == len(set(S)) else "no")

Solution (Python):

import sys, math, fractions, itertools

YES = "yes"  
NO = "no"  

def solve(S: str):
    if len(set(S)) == len(S):
        print('yes')
    else:
        print('no')
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
S = list(input())
S_set = list(set(S))

ans = 1

for s in S_set:
    if S.count(s) > 1:
        ans = 0

if ans:
    print('yes')
else:
    print('no')

Solution (Python):
s = list(input())
for i in range(len(s)):
    if s.count(s[i]) >= 2:
        print("no")
        exit()
print("yes")

Solution (Python):
st = input()
tmp = []
for s in st:
    tmp.append(s)
if len(tmp) == len(set(tmp)):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
print('yes' if len(set(s)) == len(s) else 'no')

Solution (Python):
S = input()

if len(S)==len(set(S)):
  print("yes")
else:
  print("no")

Solution (Python):
s=input()
characters=[]
res=True
for i in s:
  characters.append(i)
characters.sort()
for k in range(len(characters)-1):
  if characters[k+1]==characters[k]:
    res=False
if res:
  print('yes')
else:
  print('no')

Solution (Python):
s = input()
letter = []
flag = True
for i in range(len(s)):
  if s[i] in letter:
    flag = False
    break
  else:
    letter.append(s[i])
if flag == True:
  print("yes")
else:
  print("no")

Solution (Python):
S = list(input())
list_len = len(S)
if list_len == len(set(S)):
	print('yes')
else:
	print('no')

Solution (Python):
S = input()
a = 0

for j in range(len(S)):
    for k in range(j + 1,len(S)):
        if S[j] == S[k]:
             print('no')
             a = 1
             break
    if(a == 1):
       break

if a == 0:
    print('yes')

Solution (Python):
S=input();print(["no","yes"][len(S)==len(set(S))])

Solution (Python):





s = list(input())
s_unique = list(set(s))
if len(s) == len(s_unique) :
    print('yes')
else:
    print('no')

Solution (Python):
S = input()
print("yes" if len(S) == len(set(S)) else "no")

Solution (Python):
S = input()
set_S = set(S)

if len(S) == len(set_S):
    print('yes')
else:
    print('no')

Solution (Python):
S=input()
flag=0
for i in range(len(S)):
  for j in range(i+1,len(S)):
    if S[i]==S[j]:
      flag=1

if flag==1:
  print('no')
else:
  print('yes')

Solution (Python):
S = input()
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    a, b = LI()
    if a + b >= 10:
        print("error")
    else:
        print(a + b)
    return


def B():
    s = S()
    if len(s) == len(set(s)):
        print("yes")
    else:
        print("no")
    return


def C():
    return


def D():
    return



if __name__ == '__main__':
    B()

Solution (Python):
s = input()
for i in range(len(s)):
  if s.count(s[i]) != 1:
    print('no')
    break
  if i == len(s)-1:
    print('yes')

Solution (Python):
a = input()
b = {}
for i in range(len(a)):
    if a[i] not in b:
        b.setdefault(a[i], 1)
    else:
        b[a[i]] += 1
for i in b.values():
    if i > 1:
        print("no")
        exit()
print("yes")

Solution (Python):
s=list(map(str,input()))
print('yneos'[sorted(list(set(s)))!=sorted(s)::2])

Solution (Python):
s=input()
ss=set(s)
if len(s)==len(ss):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
for i in range(len(s)):
  if s.count(s[i]) > 1:
    print('no')
    exit()
print('yes')

Solution (Python):
s = input()
flag = 0
for i in range(len(s)-1):
    for j in range(i+1,len(s)):
        if s[i] == s[j]:
            flag = 1
            break
    if flag == 1:
        print("no")
        break
else:
    print("yes")

Solution (Python):
def main():
    S = sorted(input())
    for i in range(len(S) - 1):
        if S[i] == S[i + 1]:
            print('no')
            return
    print('yes')


main()

Solution (Python):
s = input()

alist = [w for w in s]

if len(set(alist)) == len(alist):
    print("yes")
else:
    print("no")

Solution (Python):
a = input()
for i in range(len(a)):
    for j in range(len(a)):
        if i != j and a[i] == a[j]:
            print("no")
            exit()
print("yes")

Solution (Python):
S = input()
print("yes") if(len(S)==len(set(S))) else print("no")

Solution (Python):
s = input()
print('yes' if len(s) == len(set(s)) else 'no')

Solution (Python):


def main():
    data = list(input())
    aaa  = set(data)

    if len(data) == len(aaa):
        print('yes')
    else:
        print('no')

if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter
s = input()
ans = len(Counter(s).most_common()) == len(s)
print("yes" if ans else "no")

Solution (Python):



s = input()

if len(s) == len(list(set(s))):
    print('yes')
else:
    print('no')

Solution (Python):
word = list(input())
if len(set(word)) == len(word):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
print('yes' if len(s) == len(set(s)) else 'no')

Solution (Python):
s = input()
t = ''
for i in s:
    if i not in t:
        t += i
    else:
        print('no')
        exit()
print('yes')

Solution (Python):
s = input()
t = ''
for i in s:
    if i not in t:
        t += i
    else:
        print('no')
        break
if t == s:
    print('yes')

Solution (Python):
s = input()
t = ''
for i in s:
    if i not in t:
        t += i
    else:
        print('no')
        t = ''
        break
if t != '':
    print('yes')

Solution (Python):
S = input()
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
for i in range(len(s)):
    for j in range(i):
        if s[i] == s[j]:
            print("no")
            exit()
print("yes")

Solution (Python):
S = input()

if len(set(S)) == len(S):
    print('yes')
else:
    print('no')

Solution (Python):

S = input()

dic = {}
ans = "yes"

for i in S:
    
    if i in dic:
        ans = "no"

    else:
        dic[i] = 1

print (ans)

Solution (Python):
S=list(input())
setS=set(S)
if len(setS)==len(S):
  print("yes")
else:
  print("no")

Solution (Python):
l=list(str(input()))
s=set(l)
if len(l)==len(s):print("yes")
else:print("no")

Solution (Python):
S = input()
d = {}
for s in S:
    if s in d:
        print("no")
        exit()
    else:
        d[s] = True
print("yes")

Solution (Python):
a = input()
b = set(a)

if len(a)==len(b):
  print("yes")
else:
  print("no")

Solution (Python):
S = input()
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
lst = list(set(s))
if len(lst)==len(s):
    print('yes')
else:
    print('no')

Solution (Python):
S=list(input())
s=set(S)
if len(S)==len(s):
    print("yes")
else:
    print("no")

Solution (Python):
s = input()
ss = "".join(set(s))
print("yes") if len(s) == len(ss) else print("no")

Solution (Python):
S = input()
s = set(S)
if len(s)==len(S):
    print("yes")
else:
    print("no")

Solution (Python):

S = input()
S_lst = []
for i in range(len(S)):
    S_lst.append(S[i])
S_lst.sort()
flag = True
for i in range(len(S)-1):
    if S_lst[i] == S_lst[i+1]:
        flag = False
if flag:
    print('yes')
else:
    print('no')

Solution (Python):
from collections import defaultdict

S = input()
D = defaultdict(int)
for s in S:
    D[s] += 1

for v in D.values():
    if v != 1:
        print("no")
        break
else:
    print("yes")

Solution (Python):
from sys import stdin
S = (stdin.readline().rstrip())
if len(S) == len(set(S)):
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
ans="yes"
for i in range(len(s)):
    for j in range(len(s)):
           if s[i]==s[j] and i!=j:
                ans="no"
                break
print(ans)

Solution (Python):
S = input()
D = {}
ans = "yes"
for s in S :
    if s not in D :
        D[s] = 1
    else :
        ans = "no"
        break
print(ans)

Solution (Python):
s=input()
if len(s)==len(set(s)):
    print('yes')
else:
    print('no')

Solution (Python):
s=list(input())
l=len(s)
s=set(s)
if len(s)==l:
    print('yes')
else:
    print('no')

Solution (Python):
S = list(input())
print('yneos'[len(S) != len(set(S))::2])

Solution (Python):
from collections import Counter

S = list(input())

C = Counter(S).most_common()

flag = True
for i, j in C:
    if j != 1:
        flag = False

if flag:
    print('yes')
else:
    print('no')

Solution (Python):

import time
import re
import math
import fractions

def main():
    s=input()
    if len(s)==len(set(list(s))):
        print("yes")
    else:
        print("no")
start=time.time()
main()

Solution (Python):
s = input()
ans1 = len(s)
a = list(set(s))
ans2 = len(a)
if(ans1 == ans2):
    print("yes")
else:
    print("no")

Solution (Python):

import sys
sys.setrecursionlimit(300000)

YES = "yes"  
NO = "no"  

def solve(S: str):
    s = set(S)
    ret = YES
    if len(s) != len(S):
        ret = NO
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

S = s()
seen = set()

for c in S:
    if c in seen:
        print('no')
        import sys
        sys.exit()
    seen.add(c)

print('yes')

Solution (Python):
s=input()
sl=set([s[i] for i in range(len(s))])
if len(s)==len(sl):
    print('yes')
else:
    print('no')

Solution (Python):
S = input()
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
if len(s) != len(set(list(s))):
  print("no")
else:
  print("yes")

Solution (Python):
s=input()
print('yes' if len(s) == len(set(s)) else 'no')

Solution (Python):
def abc():
    s = input().rstrip()
    print('yes' if len(s) == len(set(s)) else 'no')


abc()

Solution (Python):
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
import bisect
import copy
import fractions
import itertools
import math
import queue
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))


s = IS()
for i in s:
    if s.count(i) >= 2:
        print('no')
        exit()
print('yes')

Solution (Python):


import collections

S = input()
S_dic = collections.Counter(S)
S_srt = sorted(S_dic.items(), key=lambda x : -x[1])

if S_srt[0][1] == 1:
    print("yes")
else:
    print("no")

Solution (Python):
s = list(str(input()))
ans = list(set(s))
ans.sort()
s.sort()
if ans == s :
	print('yes')
else :
	print('no')

Solution (Python):
S = list(input())

for i in S:
    if S.count(i) != 1:
        print ('no')
        exit()
print ('yes')

Solution (Python):
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")


S = sys.stdin.readline().rstrip()
if len(S) == len(set(list(S))):
    print('yes')
else:
    print('no')

Solution (Python):
S = input()
print('yes' if len(S) == len(set(S)) else 'no')

Solution (Python):
s = [str(i) for i in input()]
s.sort()
x = s[0]
cnt = 0
for i in range(1,len(s)):
    if x == s[i]:
        cnt = 1
        break
    else:
        x = s[i]
if cnt == 0:
    print('yes')
else:
    print('no')

Solution (Python):
lis = list(input())
set_lis = set(lis)

if len(lis) == len(set_lis):
  print("yes")
else:
  print("no")

Solution (Python):
S = input()
K =[]
for i in range(len(S)):
  if S[i] in K:
    print("no")
    break
  else:
    K.append(S[i])
  if i == len(S)-1:
    print("yes")

Solution (Python):
S=input()
S2=set(S)
if len(S)==len(S2):
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
flag=0
for i in range(1,len(s)):
  if s[i] in s[:i]:
    flag=1
    break
if flag==0:
  print("yes")
else:
  print("no")

Solution (Python):
S=input()
if len(S)==len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):
S=input()
if len(set(S))==len(S):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
bl = len(s) == len(set(s))
answer = 'yes' if bl else 'no'
print(answer)

Solution (Python):
s=list(input())

ans=sorted(s)



for i in range(len(ans)-1):
    if ans[i]==ans[i+1]:
        print("no")
        exit()
print("yes")

Solution (Python):
S = input()
S = list(S)
l = set(S)

if len(S) == len(l):
    print('yes')
else:
    print('no')

Solution (Python):
from collections import Counter
s = input()
m = Counter(s)
if len(m) == len(s):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
if len(s) == len(set(s)):
    print('yes')
else:
    print('no')

Solution (Python):
s=input()
if len(s)==len(list(set(s))):
  print('yes')
else:
  print('no')

Solution (Python):
S = input()

if len(set(S)) == len(S):
    print("yes")
else:
    print(("no"))

Solution (Python):
S = input()
if len(set(S)) == len(S):
    print("yes")
else:
    print(("no"))

Solution (Python):
s=list(input())

s=sorted(s)

for i in range(len(s)-1):
    for j in range(i+1,len(s)):
        if s[i]==s[j]:
            print("no")
            exit()

print("yes")

Solution (Python):
import sys
input = sys.stdin.readline

s = input()
for i in range(len(s)):
    if s[i] in s[:i]:
        print('no')
        sys.exit()
print('yes')

Solution (Python):
S = list(input())
A = set(S)

if len(S) == len(A):
    print('yes')
else:
    print('no')

Solution (Python):
S = input()
if len(S) == len(set(S)):
    print("yes")
else:
    print("no")

Solution (Python):
s = input()
if len(s)==len(list(set(s))):
    print("yes")
else:
    print("no")

Solution (Python):


s = input()

print('yes' if len(s) == len(set(s)) else 'no')

Solution (Python):


s = input()

print('yes' if len(s) == len(set(s)) else 'no')

Solution (Python):
S=input()
s=set()
for i in S:
    if i in s:
        print("no")
        quit()
    s.add(i)
print("yes")

Solution (Python):
S = input()
countlist = []
for i in range(0, 26):
	countlist.append(0)
for i in range(0, len(S)):
	countlist[ord(S[i])-97] += 1
flag = True
for i in range(0, 26):
	if countlist[i] > 1:
		flag = False
		break
if flag: print('yes')
else: print('no')

Solution (Python):
s = input()
ans = "yes"
for i in range(len(s) - 1):
    for j in range(i + 1, len(s)):
        if s[i] == s[j]:
            ans = "no"
print(ans)

Solution (Python):
s = list(input())
size = len(s)
count = 0 
ans = {}
for i in s:
    
    if i in ans.keys() :
        count += 1
    else : 
        ans[i] = 1
        pass
if count == 0 : print("yes")
else: print("no")

Solution (Python):
s = input()

print("yes" if len(s) == len(set(s)) else "no")

Solution (Python):
S = input()

if len(S) == len(set(S)):print('yes')
else: print('no')

Solution (Python):
s = list(input())
n = set(s)
ans = 'yes'
for nn in n:
    if s.count(nn) != 1:
        ans = 'no'
        break
print(ans)

Solution (Python):
s = input()
se = set(list(s))

if len(s) == len(se):
    print("yes")
else:
    print("no")

Solution (Python):
input_char = input()

length = len(input_char)

for i in range(length-1):
    remain_index = length*(-1)+i+1
    if input_char[i] in input_char[remain_index:]:
        print('no')
        break;

    if i+2==length:
        print('yes')

Solution (Python):
s = input()
print("yes" if len(s) == len(set(s)) else "no")

Solution (Python):
import collections
s = input()
alph = "abcdefghijklmnopqrstuvwxyz"
col = dict(collections.Counter(s))

flag = True
for i in range(26):
    if col.get(alph[i], 0) > 1:
        print("no")
        flag = False
        break
if flag:
    print("yes")

Solution (Python):
s=input()
for i in range(len(s)):
  if s.count(s[i])!=1:
    print('no')
    break
else:
  print('yes')

Solution (Python):
s=input()
print("yes" if len(s)==len(set(s)) else "no")

Solution (Python):
s = input()
S = set((s))
if len(s) == len(S):
    print("yes")
else:
    print("no")

Solution (Python):
S=input()
if len(S)==len(set(S)):
    print("yes")
else:
    print("no")

Solution (Python):


import itertools
from collections import Counter
from collections import defaultdict
import bisect
from heapq import heappush, heappop

def main():
    S = list(input())
    L = set(S)
    print('yes' if len(S) == len(L) else 'no')

if __name__ == '__main__':
    main()

Solution (Python):
import collections

s = input()
cou = collections.Counter(s)
most = cou.most_common(1)

print('yneos'[most[0][1]!=1::2])

Solution (Python):
s = input()
frag = 0
for i in range(len(s)):
    for j in range(len(s)-i-1):
        if s[i] == s[j+i+1]:
            frag += 1
            break
            
if frag == 0:
    print("yes")
else:
    print("no")

Solution (Python):
import collections


def main():
    S = input()
    c = collections.Counter(S)
    ans = "no"
    if set(c.values()) == set([1]):
        ans = "yes"

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
S = list(str(input()))

def check(S):
  ans = "yes"
  for s in S:
    if S.count(s) >=2:
      ans = "no"
      break
  return ans

print(check(S))

Solution (Python):
s = input()
m = []
f = True
for i in range(len(s)):
    if s[i] in m:
        f = False
        break
    m.append(s[i])
print("yes" if f else "no")

Solution (Python):
s = input()
ans = "yes"
for i in range(len(s)):
    if s.count(s[i]) != 1:
        ans = "no"
        break
print(ans)

Solution (Python):
s = list(input())

s2 = list(set(s))

ans = "no"
if len(s) == len(s2):
  ans = "yes"

print(ans)

Solution (Python):
s = list(input())

set_s = set(s)

if len(s) == len(set_s):
    print("yes")
else:
    print("no")

Solution (Python):
a = input()
b = len(a)
c = len(set(a))

if b == c:
  print('yes')
else:
  print('no')

Solution (Python):
S = input()
x = len(S)
tmp = set(S)
y = len(tmp)
if x == y:
  print("yes")
else :
  print("no")

Solution (Python):
s = input()
x = len(s)
tmp = set(s)
y = len(tmp)
if x == y:
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
h = len(s)
x = set(s)
y = len(x)
if y == h:
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
if len(s)-len(set(s))==0:
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
a=len(s)
b=len(set(s))
if a-b==0:
    print("yes")
else:
    print("no")

Solution (Python):
import collections
S = input()
N = collections.Counter(S)
if len(S) == len(N):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
x = len(s)
tmp = set([])
for i in s:
    tmp.add(i)

if x == len(tmp):
    print('yes')
else:
    print('no')

Solution (Python):
alp = "abcdefghijklmnopqrstuvwxyz"
S = input()
ans = [0]*26
for c in S:
    ans[alp.index(c)]+=1
if max(ans) == 1:
    print("yes")
else:
    print("no")

Solution (Python):
S = input()
s = set(S)
if len(S) == len(s):
	print('yes')
else:
	print('no')

Solution (Python):
import collections

s = input()
s_list = []

for i in s:
    s_list.append(i)

c = collections.Counter(s_list)
most = c.most_common(1)
if most[0][1] == 1:
    print("yes")
else:
    print("no")

Solution (Python):
S = input()
L = len(list(set(S)))
if L == len(S):
    print("yes")
else:
    print("no")

Solution (Python):
S = input()

import collections as col
cc = col.Counter(S)

flag = True
for k,v in cc.items():
  if (v == 2):
    flag = False
print ( "yes" if flag else "no" )

Solution (Python):
s = input()
ans = 'yes'
ls = []
for i in s:
    if i in ls:
        ans = 'no'
        break
    else:
        ls.append(i)
print(ans)

Solution (Python):


def solve():
    S = input()

    for i in range(len(S)):
        target = S[i]
        for j in range(i+1, len(S)):
            if target != S[j]:
                continue
            print("no")
            return
    print("yes")


if __name__ == "__main__":
    solve()

Solution (Python):
s=input()
a=0
for i in s:
    if s.count(i)>1:
        a=1
print("yes" if a==0 else "no")

Solution (Python):
s = input()
flag = True
for i in range(len(s)):
    for j in reversed(range(len(s)-i-1)):
        if s[i] == s[j+i+1]:
            flag = False
if flag:
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
print("no" if len(s)!=len(set(s)) else "yes")

Solution (Python):
s = input()
print("yes" if len(set(s)) == len(s) else "no")

Solution (Python):
S = input()
S_len = len(S)
S_set_len = len(set(S))
print('yes' if S_len == S_set_len else 'no')

Solution (Python):
s = input()
print('yes' if len(s) == len("".join(set(s))) else 'no')

Solution (Python):
s=input()
print('yes' if len(set(s))==len(s) else 'no')