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()

sdic = {}

for s in S:
    if s in sdic:
        print("no")
        exit()

    sdic[s] = 1

print("yes")

Solution (Python):
s=input()
res="yes"
for i in range(97,123):
    if s.count(chr(i))>1:
        res="no"
        break
print(res)

Solution (Python):
S = input()
len_S = len(S)

len_set_S = len(set(S))

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):

















import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
X = set([s for s in S])
if (len(S) == len(X)):
    print('yes')
else:
    print('no')

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

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

Solution (Python):
S = input()
s = [S[0]]
ans = 'yes'

for i in S[1:]:
    if i in s:
        ans = 'no'
        break
    else:
        s.append(i)
print(ans)

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

Solution (Python):
S = input()

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

Solution (Python):
import collections
S=collections.Counter(x for x in input())

for k,v in S.items():
  if v!=1:
    print('no')
    break
else:
  print('yes')

Solution (Python):
S = list(input())
S.sort()
ans = True
for i in range(len(S)-1):
  if S[i] == S[i + 1]:
    ans = False
    break
if ans:
  print("yes")
else:
  print("no")

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

S = input()

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

Solution (Python):
from collections import defaultdict 

N = input()
dic = defaultdict(int)
 
for s in N:
  dic[s] += 1
  
  if dic[s] > 1:
    print('no')
    exit()
 
print('yes')

Solution (Python):
a = input()
alp =[0 for i in range(0 , 29)]
for i in a:
	alp[ord(i)-ord('a')]+=1
for i in range(0 , 26):
	if alp[i]>1:
		print("no")
		exit()
print("yes")
exit()

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    S = readline().strip()

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

    return


if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter
import sys

s=Counter(input())
for x in iter(s):
  if s[x]>1:
    print('no')
    sys.exit()
print('yes')

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

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

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

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

Solution (Python):
s = input()

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

print('yes')

Solution (Python):
S = input()

import collections

c = collections.Counter(list(S))

ans = "yes"
for i in c.values():
    if i == 1:
        pass
    else:
        ans = "no"
        break

print(ans)

Solution (Python):
S = input()
N = len(S)
a = []
for i in range(N):
    if S[i] in a:
        print('no')
        exit()
    else:
        a.append(S[i])
print('yes')

Solution (Python):
s = input()

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

Solution (Python):
s = input()

cha = []

for i in range(len(s)):
    if s[i] in cha:
        print("no")
        exit()
    else:
        cha.append(s[i])

print("yes")

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

Solution (Python):
s = input()

Flag = False
for i in range(len(s)):
    for j in range(i+1,len(s)):
        if s[i] == s[j]:
            Flag = True

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

Solution (Python):
import sys


k = 'abcdefghijklmnopqrstuvwxyz'
alp = {}

for i in k:
    alp[i] = 0


s = input()

for i in s:
    if alp[i] == 0:
        alp[i] = 1
    else:
        print('no')
        sys.exit()

print('yes')

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

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

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

Solution (Python):
s = input()
n = len(s)
rs = sorted(s)
cnt = 0
ans = 'no'
for i in range(0, n-1):
    if rs[i] != rs[i+1]:
        cnt += 1
        if cnt == n-1:
            ans = 'yes'
            print(ans)
            exit()
print(ans)

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=str(input())
ss=[S[0]]

for i in range(1,len(S)):
    if S[i] in ss:
        print('no')
        break
    else:
        ss.append(S[i])

if len(S)==len(ss):
    print('yes')

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

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

Solution (Python):
def actual(s):
    for i in range(len(s)):
        for j in range(i + 1, len(s)):
            if s[i] == s[j]:
                return 'no'
    
    return 'yes'

s = input()
print(actual(s))

Solution (Python):
def actual(s):
    if len(set(s)) == len(s):
        return 'yes'

    return 'no'

s = input()
print(actual(s))

Solution (Python):
s = input()
check = True
for c in s:
    if s.count(c) > 1:
        check = False
        break
print('yes' if check else 'no')

Solution (Python):
S = input()
al = [0] * 26
s = ""
for s in S:
    al[ord(s) - 97] += 1

for a in al:
    if a >= 2:
        s = "no"
        break
    else:
        s = "yes"

print(s)

Solution (Python):
MM = input()
M = list(MM)
count = 0
for i in M:
  if M.count(i) >1:
    count =1
if count == 0:
  print('yes')
else:
  print('no')

Solution (Python):
s=list(input())
dic={}
for i in s:
  if i in dic:
    print('no')
    exit()
  else:
    dic[i]=1
print('yes')

Solution (Python):
S = input()
a = []
for s in S:
  if s in a:
    print("no")
    exit()
  else:
    a.append(s)

print("yes")

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

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

Solution (Python):
S = input()
for s in S:
    if S.count(s) > 1:
        print('no')
        exit(0)
print('yes')

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

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

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

Solution (Python):
s = input()

for i in range(len(s)):
    for j in range(len(s)):
        if s[i] == s[j] and i != j:
            print("no")
            exit()
else:
    print("yes")

Solution (Python):
def main():
    S = list(input().rstrip())
    if len(S) == len(set(S)):
        print("yes")
    else:
        print("no")


if __name__ == '__main__':
    main()

Solution (Python):
s = input()

words = list(s)

check = True

for j in range(len(words)):
    for i in range(len(words) - (j + 1)):
        if words[j] == words[j + i + 1]:
            check = False
            
            break

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

Solution (Python):

import sys
S = input()
l = len(S)

for i in range(l):
    cou = 0
    for j in range(l):
        if S[i] == S[j]:
            cou +=1
    if cou == 2:
        print("no")
        sys.exit()
print("yes")

Solution (Python):
S = input()
S_list = [s for s in S]

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

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

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

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

Solution (Python):
from sys import exit
S = input()
for i in range(len(S)):
  for j in range(i):
    if S[i] == S[j]:
      print('no')
      exit(0)
  for j in range(i+1,len(S)):
    if S[i] == S[j]:
      print('no')
      exit(0)
print('yes')

Solution (Python):
S = input()
C = []
for i in range(len(S)):
  if S[i] in C:
    print('no')
    break
  C.append(S[i])
else:
  print('yes')

Solution (Python):
from collections import Counter
S = Counter(input())
print("yes" if set(S.values()) == {1} else "no")

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

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

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

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

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

Solution (Python):
from collections import Counter
S = input()
Sd = Counter(S)

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

Solution (Python):
import sys

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

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

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

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

Solution (Python):
import collections

S = input()

l = collections.Counter(S).values()
if(max(l)>1):
	print('no')
else:
	print('yes')

Solution (Python):
def hantei(s):
    return len(s) == len(set(s))

def main():
    s = input()
    s = list(s)

    if hantei(s) == True:
        print('yes') 
    else:
        print('no')
        
if __name__ == '__main__':
    main()

Solution (Python):
s=input()
c='yes'
for i in range(len(s)):
    for j in range(i+1,len(s)):
        if s[i]==s[j]:
            c='no'

print(c)

Solution (Python):
S = input()
C = []
f = True
for s in S:
  if s not in C:
    C.append(s)
  else:
    f = False
print('yes' if f else 'no')

Solution (Python):
import collections
c = collections.Counter(input()[:])

if c.most_common()[0][1] == 1:
    print('yes')
else:
    print('no')

Solution (Python):
from collections import Counter

s = list(input())
ans = True
for x in Counter(s).values():
    if x > 1:
        ans = False
print(["no", "yes"][ans])

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

Solution (Python):
s = input()

n = list(s)

sets = set(n)

if len(n) == len(sets):
    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 = list(input())

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

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    S = list(input().strip("\n"))
    if len(S) == len(set(S)): print("yes")
    else: print("no")
    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
import sys
S = input()
B = [False] * 26
for s in S:
    if B[ord(s) - ord('a')]:
        print('no')
        sys.exit()
    else:
        B[ord(s) - ord('a')] = True
print('yes')

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

Solution (Python):

s = input()
print("yneos"[len(s) != len(set(i for i in s))::2])

Solution (Python):
s=input()
alp='abcdefghijklmnopqrstuvwxyz'
A=[0 for i in range(26)]
for ss in s:
    A[alp.index(ss)]+=1
print("yes" if all(a<=1 for a in A)==True else "no")

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(len(s)):
        if s[i]==s[j] and i!=j:
            print("no")
            exit()

print("yes")

Solution (Python):
S = input()

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

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
S = str(input())

from collections import Counter
for i in range(len(S)):
    if S.count(S[i]) > 1:
        print('no')
        sys.exit()
print('yes')

Solution (Python):
S = list(input())
if len([x for x in set(S) if S.count(x) > 1]) == 0:
    print("yes")
else:
    print("no")

Solution (Python):
s = list(input())
if len(set(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):
s = list(input())
i = len(s)
s = list(set(s))
j = len(s)

if i != j:
    print('no')
else:
    print('yes')

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

Solution (Python):
s = input()
t = {s[i] for i in range(len(s))}

ans = "yes" if len(s) == len(t) else "no"
print(ans)

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

s=list(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):
import math
import collections
import fractions
import itertools

def solve():
    s = list(input())
    if len(s) == len(set(s)):
        print("yes")
    else:
        print("no")
    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
s=input()
n=len(s)
d=set()
for ss in s:
  d.add(ss)
if len(d)==n:
  print("yes")
else:
  print("no")

Solution (Python):
import sys
s=input()
t=set()
for i in range(len(s)):
  if s[i] in t:
    print('no')
    sys.exit()
  t.add(s[i])
print('yes')

Solution (Python):
S = input().strip()
C = {}
for i in range(len(S)):
    a = S[i]
    if a not in C:
        C[a] = 0
    C[a] += 1
if len(S)==len(C):
    print("yes")
else:
    print("no")

Solution (Python):
S = str(input())
L = len(S)
ST = set(list(S))

if L == len(ST):
  print("yes")
else:
  print("no")

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

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

Solution (Python):
s = input()
t = set([c for c in s])

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

Solution (Python):
s = input()
n = len(s)

for i in range(n):
    for j in range(i+1, n):
        if s[i] == s[j]:
            print('no')
            exit()

print('yes')

Solution (Python):
s = input()
flg = 1

for i in range(len(s)):
    cou = s.count(s[i])
    if (cou > 1) :
        flg = 0
        break
if (flg) : print("yes")
else : print("no")

Solution (Python):
import sys
from collections import Counter
S = list(input())
C = Counter(S)
for k, v in C.items():
    if v != 1:
        print('no')
        sys.exit()
print('yes')

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

Solution (Python):
import collections
s = input()

c = collections.Counter(s)

for ch in c:
    if c[ch] >= 2:
        print("no")
        break
else:
    print("yes")

Solution (Python):
s = input()

check = [0]*26

for i in range(len(s)):
    tmp = ord(s[i]) % 26
    if check[tmp] == 1:
        print('no')
        exit()
    check[tmp] = 1
else:
    print('yes')

Solution (Python):
S = input()
s_list = [s for s in S]
s_set = set(s_list)
if len(s_list)==len(s_set):
    print('yes')
else:
    print('no')

Solution (Python):
S=input()
F=True
T=set()

for s in S:
    F&=(s not in T)
    T.add(s)
    
if F:
    print("yes")
else:
    print("no")

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

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

Solution (Python):


S = list(str(input()))

S_num = len(set(S))

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

Solution (Python):
s = input()

def solve(x):
    l = []
    for c in x:
        if c in l:
            return False
        l.append(c)
    return True

if solve(s):
    print('yes')
else:
    print('no')

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

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

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

Solution (Python):









import sys
input = sys.stdin.readline

S = input()
Sset = set(S)

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

Solution (Python):
s = input()
n = len(s)
for i in range(n):
  for j in range(i+1,n):
    if s[i] == s[j]:
      print('no')
      exit()
    
print('yes')

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("no" if len(S)-len(set(S)) else "yes")

Solution (Python):
S = input()
char = [chr(ord('a') + i) for i in range(26)]
for c in char:
    if S.count(c) > 1:
        print('no')
        break
else:
    print('yes')

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

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

Solution (Python):
S = input()

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

Solution (Python):
S = input()

words = []
for s in S:
    if s not in words:
        words.append(s)
    else:
        print("no")
        break
else:
    print("yes")

Solution (Python):
s = str(input())
apple = []
for i in s:
    apple.append(i)
print("yes" if len(apple) == len(set(apple)) else "no")

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

Solution (Python):
import sys
S = str(input())
if len(S) < 2 or len(S) > 27:
    sys.exit()
if not S.islower():
    sys.exit()

result = 'yes'
for I in range(len(S)):
    if S.count(S[I]) > 1:
        result = 'no'
print(result)

Solution (Python):
testStr =[i for i in input()]
setList = set(testStr)
print("yes" if len(testStr) ==len(setList) else "no")

Solution (Python):
import collections 
s = input()
s_collection = collections.Counter(s)

flag = True
for value in s_collection.values():
  if value > 1:
    flag = False

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

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

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

S_s = set(S)

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

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

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

Solution (Python):
def resolve():
    S = input()
    c = set()
    l = 0
    for s in S:
        c.add(s)
        if l == len(c):
            print("no")
            return
        l += 1
    print("yes")


resolve()

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 = len(s)
ans = "yes"
for i in range(n):
  if s.count(s[i]) != 1:
    ans = "no"
print(ans)

Solution (Python):
import copy
s = input()
ss = list(s)
sss = copy.copy(ss)
n = len(ss)
ans = "yes"

for i in range(n):
  sss = copy.copy(ss)
  sss.remove(sss[i])
  if ss[i] in sss:
    ans = "no"
print(ans)

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

Solution (Python):
s = list(str(input()))
d = dict.fromkeys(s)
if len(s) == len(d):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
ls = []
ans = 1

for i in range(len(s)):
    if s[i] not in ls:
        ls.append(s[i])
    else:
        ans = 0
        break

if ans == 0:
    print("no")
else:
    print("yes")

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

Solution (Python):
S = input()

lis_S = list(S)
set_S = set(S)

if len(lis_S) == len(set_S):
    print("yes")
else:
    print("no")

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

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

Solution (Python):
S = input()

l = []

for s in S:
    if s in l:
        print('no')
        exit()
    l.append(s)
print('yes')

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

a = len(S)
b = len(ans)

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

Solution (Python):


import sys
input=sys.stdin.readline

def main():
    ab="qwertyuiopasdfghjklzxcvbnm"
    S=input()
    y=1
    for a in ab:
        if S.count(a)>1:
            y=0
            break
    if y==1:
        print("yes")
    else:
        print("no")
    
if __name__=="__main__":
    main()

Solution (Python):
s = input()
for i in s:
    if s.count(i) != 1:
        print('no')
        exit()
print('yes')

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

Solution (Python):
S = input()

if len(set(S)) == len(S) :
    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=input()
x=len(s)
t=set(s)
y=len(t)

if x==y:
    print('yes')
else:
    print('no')

Solution (Python):
def resolve():
    s = input()

    ans = str()
    for char in s:
        if s.count(char) >1:
            ans = "no"
            break
        else:
            ans = "yes"
    print(ans)
resolve()

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

Solution (Python):
def countchar(s) : 
  countstr = [0] * 300
  for i in s : 
    if countstr[ord(i)] != 0 : 
      return False
    countstr[ord(i)] += 1
  return True


s = input()


if countchar(s) : 
  print('yes') 
else : 
  print('no')

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

Solution (Python):
from collections import Counter

S=list(input())
count=Counter(S)
for key,cnt in count.most_common():
    if cnt!=1:
        print("no")
        exit()
print("yes")

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

Solution (Python):
import collections

s = input()

count = collections.Counter(s)

_max = 0
for i in count.values():
  if _max < i:
    _max = i
if _max >= 2:
  print("no")
else:
  print("yes")

Solution (Python):
s=list(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):
s=input();print("yneos"[len(s)!=len(set(s))::2])

Solution (Python):
def main():
    S = input()
    A = [False]*26
    for char in S:
        if A[ord(char) - ord("a")]:
            print("no")
            return
        else:
            A[ord(char) - ord("a")] = True
    print("yes")

main()

Solution (Python):

import sys
from collections import defaultdict, deque




def solve():
    s = input()
    w = set()
    for e in s:
        if e in w:
            print('no')
            return
        w.add(e)
    print("yes")

        
t = 1

for case in range(1,t+1):
    ans = solve()



"""

1 4
7
RRRR
1 1 0 1
----
4

1 4
47
RCRR
1 1 0 1
----
-1

2 2
10
RR
RR
1 7
4 1
----
4

2 2
10
RR
RR
7 4
7 4
----
-1

3 3
8
RCR
RRC
RRR
1 1 1
1 1 1
1 3 1


3 3
1
RCR
RRC
RRR
1 1 1
1 1 1
1 3 1


"""

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
def i():
	return str(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

s = list(i())
s.sort()

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

Solution (Python):
def i():
	return str(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

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

Solution (Python):
S = input()
def judge(S):
  memo = []
  for i in range(len(S)):
    if S[i] in memo:
      return False
    memo.append(S[i])
  return True

print("yes" if judge(S) else "no")

Solution (Python):
s=list(input())
li=[]
non=False
for c in s:
  if c in li:
    non=True
    break
  li.append(c)
    
if non:
  print("no")
  
else:
  print("yes")

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


def read():
    S = input().strip()
    return S,


def solve(S):
    u = set(S)
    return "yes" if len(u) == len(S) else "no"


if __name__ == '__main__':
    inputs = read()
    print(solve(*inputs))

Solution (Python):






S = input()





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

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

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



if __name__ == '__main__':
    solve()

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

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

Solution (Python):
import sys
arr_S = []
S = str(input())

for i in range(0,len(S)):
  arr_S.append(S[i])
for i in range(0,-1+len(S)):
  if sorted(arr_S)[i+1] == sorted(arr_S)[i]:
    print("no")
    sys.exit()
print("yes")

Solution (Python):
def main():
    S = input()

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


if __name__ == "__main__":
    main()

Solution (Python):
S = input()
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):
s = input()
n = len(s)
l = list()
for a in range(n):
    l.append(s[a])

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

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

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

Solution (Python):
s=input()
li=[]
result='yes'
for i in s:
    if i in li:
        result='no'
    li.append(i)
print(result)

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

flag = True
for i in range(len(l) - 1):
    if l[i] in l[i + 1:]:
        flag = False

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

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

Solution (Python):
S = list(input())
S.sort()
flag = 0
for i in range(len(S)- 1):
  if(S[i] == S[i+ 1]):
    flag = 1
    break
if(flag == 1):
  print("no")
else:
  print("yes")

Solution (Python):
import sys
s=input()
alphabet=[chr(i) for i in range(97,97+26)]
for i in alphabet:
    if s.count(i)>=2:
        print("no")
        sys.exit()
print("yes")

Solution (Python):
S = input()

s = list(set(S))

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

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

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

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

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

Solution (Python):


if __name__ == '__main__':
    s= input()
    len1 = len(s)
    len2 = len(set(s))

    if len1 == len2:
        print("yes")
    else:
        print("no")

Solution (Python):
S = list(input())
A = []
for s in S:
    if s in A:
        print('no')
        exit()
    A.append(s)
print('yes')

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

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

Solution (Python):
s = sorted(list(input()))
for i in range(len(s) - 1):
  if s[i] == s[i + 1]:
    print('no')
    break
else:
  print('yes')

Solution (Python):

import sys

YES = "yes"  
NO = "no"  


def solve(S: str):
    print(YES if len(set(S)) == len(S) else 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 = input()
l = len(s)
s = set(s)
if len(s)==l:
    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(set(S)) == len(S) else "no")

Solution (Python):
S = input()

a = []
result = "yes"
for s in S:
    if s in a:
        result = "no"
        break
    a.append(s)

print(result)