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

Solution (Python):
S = input()

L = []
for i in range(len(S)):
    L.append(S[i])

B = False
for i, v in enumerate(L):
    L.pop(i)
    if (v in L):
        B = True
        break
    else:
        L.insert(i, v)

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

Solution (Python):
s = list(input())
s.sort()
b = ""
ans = "yes"
for x in s:
    if b == x:
        ans = "no"
        break
    b = x
print(ans)

Solution (Python):
s=str(input())
x=0
for i in range(len(s)):
  if s.count(s[i])==1:
    x+=1
if x==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 = input()
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):
S = input()
res = 0
for i in range(len(S)):
    for n in range(i+1,len(S)):
        if S[i]==S[n]:
            res=1
if res ==0:
    print('yes')
else:
    print('no')

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

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

Solution (Python):
S=str(input())
no = False
for i in range(len(S)):
  for k in range(i+1,len(S)):
    if S[i] == S[k]:
      no = True
      break
if no:
  print('no')
else:
  print('yes')

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):

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

Solution (Python):
S = list(input())
flag = [0]*26
for c in S:
    if(flag[ord(c)-ord('a')] == 0):
        flag[ord(c)-ord('a')] = 1
    else:
        print("no")
        exit()
print("yes")

Solution (Python):
S = input()

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

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):
l=[x for x in input()]
nl=list(set(l))
if len(l)==len(nl):
    print ('yes')
else:
    print ('no')

Solution (Python):

s=input()
ans=''
for i in range(len(s)):
    if s[i] not in ans:
        ans+=s[i]
if len(ans)==len(s):
    print('yes')
else:
    print('no')

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

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

l = set(s)
m = len(l)

if n == m:
  print("yes")
else:
  print("no")

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

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


if __name__ == '__main__':
    main()

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

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

new_s = set(s)

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

Solution (Python):
import collections

S = input()
c = collections.Counter(S)
keys = c.keys()
print("yes") if len(keys) == len(S) else print("no")

Solution (Python):
A=[0]*26
S=input().rstrip()
for i in range(len(S)):
  A[ord(S[i])-ord("a")]+=1
flg=True
for i in range(26):
  if A[i]>=2:
    flg=False
    break
if flg: print("yes")
else: print("no")

Solution (Python):
S = input()

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

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

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

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

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

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

Solution (Python):
s=input()
count=0
for member in s:
    count=0
    for member2 in s:
        if member2==member:
            count+=1
    if count>=2:
        print("no")
        break
if count==1:
    print("yes")

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

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

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

Solution (Python):
S = input()
cnt = 0
for i in range(len(S)):
    for j in range(len(S)):
        if i == j : pass
        elif S[i] == S[j]: cnt += 1
        else: pass
        if cnt != 0: break
    if cnt != 0 :break
if cnt == 0:
  print("yes")
else:
  print("no")

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

Solution (Python):
import string
al = string.ascii_lowercase

S = input()
ans = "yes"
for a in al:
  if S.count(a) > 1:
    ans = "no"
print(ans)

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

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

Solution (Python):
icase=0
if icase==0:
    import sys
    s=list(input())
    s.sort()
    for i in range(len(s)-1):
        if s[i+1]==s[i]:
            print("no")
            sys.exit()
    print("yes")

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

Solution (Python):
import sys
S = input()

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

print('yes')

Solution (Python):
s=input()
l=len(s)
sl=list(s)
sl.sort()
ans='yes'
for i in range(l-1):
  if sl[i]==sl[i+1]:
    ans='no'
    break
print(ans)

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

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

print(ans)

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

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

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

Solution (Python):
S = input()
cnt = 0
for i in range(len(S)):
    for j in range(len(S)):
        if i == j : pass
        elif S[i] == S[j]: cnt += 1
        else: pass
        if cnt != 0: break
    if cnt != 0 :break
    
print("yes" if cnt == 0 else "no")

Solution (Python):












S = input()

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

print(ans)

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

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

Solution (Python):
S = input()

dic_S = {}
for n,s in enumerate(S):
    dic_S[s] = n

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

Solution (Python):

s = list(input())
l = 0

t = s.copy()
t = set(t)
t = list(t)
l = len(t)

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

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

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

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

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

Solution (Python):
from collections import defaultdict
S = input()
d = defaultdict(int)
for i in range(len(S)):
  d[S[i]] += 1
for val in d.values():
  if val != 1:
    print("no")
    exit()
print("yes")

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

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

Solution (Python):
import collections

S = list(input())
kind = list(collections.Counter(S).values())

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

Solution (Python):

def myAnswer(S:list)-> str:
   return "yes" if(len(S) == len(set(S))) else "no"

def modelAnswer():
   tmp=1
def main():
   S = list(input())
   print(myAnswer(S))


if __name__ == '__main__':
   main()

Solution (Python):

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

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

Solution (Python):
S = input()

s = set(S)

if len(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 = 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):
from collections import Counter
s = list(input())

dicts = Counter(s)

flag = True
for k, v in dicts.items():
    if v != 1:
        flag = False
        break

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

Solution (Python):
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

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

Solution (Python):
S = input()

used = set([s for s in S])
if (len(S) - len(used) == 0):
    print("yes")
else:
    print("no")

Solution (Python):
s = input()
cnt = {}
for x in s:
    if x not in cnt:cnt[x] = 1
    else:cnt[x] +=1
ok = True
for key in cnt:
    if cnt[key] > 1:
        ok = False
        break
if ok:print('yes')
else:print('no')

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

Solution (Python):
s = input()
words = set()
ans = 'yes'
for c in s:
    if c in words:
        ans = 'no'
        break
    words.add(c)
print(ans)

Solution (Python):

S = input()
cnt = 0
for i in S:
    if S.count(i) != 1:
        cnt +=1
if cnt == 0:
    print('yes')
else:
    print('no')

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

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

Solution (Python):
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


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

Solution (Python):
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


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

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

if __name__ == '__main__':
    main()

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

Solution (Python):
s = input()
dicts = {i: False for i in range(ord('a'), ord('z') + 1)}

for i in s:
    if dicts[ord(i)]:
        print('no')
        exit()

    dicts[ord(i)] = True
print('yes')

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()
print("yes") if len(s)==len(set(list(s))) else print("no")

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

for i in c.values():
  if i!=1:
    print("no")
    exit()
print("yes")

Solution (Python):
s = input()
ans = 'yes'
while len(s)>1:
    if s[0] in s[1:]:
        ans = 'no'
        break
    else:
        s = s[1:]
print(ans)

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

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

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

Solution (Python):
S = input()

word = 'qwertyuiopasdfghjklzxcvbnm'

for i in range(len(word)):
    if S.count(word[i]) > 1:
        print('no')
        exit()
        
print('yes')

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

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

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

Solution (Python):
s=str(input())
ch=list()
for c in 'abcdefghijklmnopqrstuvwxyz':
    ch.append(c)

for c in s:
    if c not in ch:
        print('no')
        exit()
    else:
        del ch[ch.index(c)]

print('yes')

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

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

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

Solution (Python):
s=str(input())
n=len(s)
S=set(s)
m=len(S)
if n==m:
  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(input())
word=[]
for i in range(len(s)):
    if s[i] in word:
        print("no")
        break
    else:
        word.append(s[i])
if len(word)==len(s):
    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()
r = 'yes'
for t in s:
	if s.count(t) > 1:
		r = 'no'
		break
print(r)

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

Solution (Python):




"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""








def main():
  s = input()
  dic = {}
  i = 0
  while i != len(s):
    if not s[i] in dic.keys():
      dic[s[i]] = 1
    else:
      print('no')
      exit()
    i +=1
  print('yes')
  
if __name__ == '__main__':
  main()

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

Solution (Python):

import sys
import itertools
import fractions
import copy
import bisect


from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter


N=3
M=3
i=0
j=0
k=0
n=3
r=1
a=[0]*5
b=[]
s=input()
a=[i for i in s]

count = Counter(a)

for i in range(len(a)):
    k=a.count(a[i])
    if k >1:
        print('no')
        sys.exit()
print("yes")






"1行1つの整数を入力を取得し、整数と取得する"




"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"

















'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

Solution (Python):
S = input()
a = set()
ans = 'yes'
for i in S:
    if i in a:
        ans = 'no'
        break
    else:
        a.add(i)
print(ans)

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

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

Solution (Python):
S = list(input())
for i in S:
    if S.count(i) != 1:
        print("no")
        break
else:
    print("yes")

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

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

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

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

Solution (Python):
import collections

s=input()

s=list(s)

c = collections.Counter(s)

score_sorted = sorted(c.items(), key=lambda x:-x[1])

if score_sorted[0][1] ==1:
    print('yes')
else:
    print('no')

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

Solution (Python):
S = list(input())
f = set()
ans = "yes"
for s in S:
    if (s in f):
        ans = "no"
        break
    f.add(s)

print(ans)

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

cnt = collections.Counter()

for i in s:
    cnt[i] += 1

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

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

Solution (Python):
from sys import exit
S  = input()
found = ""
for i in S:
  if i in found:
    print("no")
    exit()
  else: found += i
print("yes")

Solution (Python):
s = list(input())
s.sort()
t = s[0]
c = 1
for i in range(1, len(s)):
    if s[i] == t:
        c = 0
    t = s[i]
print("yes" if c == 1 else "no")

Solution (Python):
import math

a=input()
print("yes" if len(a)-len(set(a))==0 else "no")

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

Solution (Python):
import sys

S = input()
l = [0]*26
alfa = [chr(i) for i in range(97, 97+26)]
for i in range(len(S)):
    index = alfa.index(S[i])
    l[index] += 1
    if l[index] == 2:
        print("no")
        sys.exit()
print("yes")

Solution (Python):
S = input()

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

Solution (Python):
import collections
c=collections.Counter(input())
for i,m in c.items():
    if m>=2:
        print("no")
        exit()
print("yes")

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

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

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

Solution (Python):
S = input()
cnt = 0
for i in S:
    if S.count(i) != 1:
        cnt +=1
if cnt == 0:
    print('yes')
else:
    print('no')

Solution (Python):
s = input()

bl = len(s)
cl = len(set(s))

print('yes' if bl == cl else 'no')

Solution (Python):

S = input()
cnt = 0
for i in S:
    if S.count(i) != 1:
        cnt +=1
if cnt == 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()

letter_dict = {}

for l in S:
    letter_dict.setdefault(l, 0)
    letter_dict[l] += 1

if max(letter_dict.values()) == 1:
    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):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

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

Solution (Python):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

from collections import Counter

s = ns()
c = Counter(s)
print("yes" if len(s) == len(c) else "no")

Solution (Python):
s = input()
def has_duplicates(seq):
    return len(seq) != len(set(seq))

if (has_duplicates(s)) == True:
    print("no")
else:
    print("yes")

Solution (Python):
s = list(input())
ans = "yes"

for i in range(len(s)):
    st = s.pop(0)
    if st in s:
        ans = "no"
        break

print(ans)

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

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

if len(se)==len(list(S)):
  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(s)==len(set(s)) else 'no')

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

Solution (Python):
s = input()
m = []
for i in s:
  m.append(i)
m.sort()
for i in range(len(m)-1):
  if m[i] == m[i+1]:
    print('no')
    exit()
    
print('yes')

Solution (Python):
s = 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):
from __future__ import print_function

import sys

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd



import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


def lcm(n, m):
    return int(n * m / gcd(n, m))


def coprimize(p, q):
    common = fractions.gcd(p, q)
    return (p // common, q // common)


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


def main():
    S = input().strip()
    C=Counter()

    for i in range(len(S)):
        if C[S[i]]==0:
            C[S[i]]+=1
        else:
            print("no")
            return
    print("yes")
    return

if __name__ == '__main__':
    main()

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

s = input()
l = [chr(i) for i in range(97, 97+26)]

bool = True
for i in range(len(l)):
    ans = s.count(l[i])
    if ans <= 1:
        continue
    else:
        bool = False
        break
        
if bool:
    print('yes')
else:
    print('no')

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

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

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

Solution (Python):
import sys
import math










mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def main():
    s = list(input())
    s.sort()
    for i in range(len(s)-1):
        if s[i]==s[i+1]:
            print("no")
            return
    print("yes")
    return

if __name__=='__main__':
    main()

Solution (Python):
S=input()

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

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

Solution (Python):

s=input()
ans=[]
for c in s:
    if c not in ans:
        ans.append(c)
if len(s)==len(ans):
    print("yes")
else:
    print("no")

Solution (Python):
l = list(input())
strlen = l.__len__()
print("no" if strlen - list(set(l)).__len__() else "yes")

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

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

Solution (Python):








def resolve():
    S=str(input())
    print('yes' if len(S)==len(set(S)) else 'no')

resolve()

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

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

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

Solution (Python):

import sys


YES = "yes"  
NO = "no"  


def solve(S: str):
    print(YES if len(S) == len(set(S)) else NO)


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()
print('yes' if len(set(s)) == len(s) else 'no')

Solution (Python):
import sys
d={}
ss=input().strip()
for s in ss:
  if s in d:
    print("no")
    sys.exit()
  else:
    d[s]=1
print("yes")

Solution (Python):
a=input()
b=[str(c) for c in a]
b.sort()
c=len(b)
d=0
for i in range(c-1):
	if b[i]==b[i+1]:
		d=d+1
if d>0:
	print('no')
else:
	print('yes')

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

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

Solution (Python):

s = list(input())


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

Solution (Python):
S = input()

A =[]

for i in range(len(S)):
  A.append(S[i])

A.sort()

a = "yes"

for i in range(1,len(A)):
  if A[i] == A[i-1]:
    a = "no"
    break
print(a)

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

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

Solution (Python):

s = list(str(input()))

"""
tmp = [s[0]]
flag = True
for i in s:
    if i in tmp:
        flag = False
    else:
        tmp.append(i)

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

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=sorted(input())
f=0
for i in range(len(s)-1):
  if s[i]==s[i+1]:
    f=1
if f==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(list(S)) == len(set(S)):
    print("yes")
else:
    print("no")

Solution (Python):
S=input()
a=[b for b in S]
list=[]
number=len(a)
for c in a:
    if c in list:
        print('no')
        break
    else:
        list.append(c)
if len(list)==len(a):
    print('yes')

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

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

print(answer)

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

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

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

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