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

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

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

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

cnt=[0]*26
al = [chr(ord('a') + i) for i in range(26)]
for i in range(N):
    for j in range(26):
        if S[i] == al[j]:
            cnt[j]+=1


out='yes'
for i in range(26):
    if cnt[i]>=2:
        out='no'

print(out)

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

Solution (Python):
S = list(input())
ans = "yes"
for i in range(len(S)):
    ch = S[i]
    S[i] = "-1"
    if ch in S:
        ans = "no"
        break
print(ans)

Solution (Python):
from collections import Counter

string = Counter(input())

for _ in string.values():
    if _ > 1:
        print("no")
        break
else:
    print("yes")

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

Solution (Python):
s = input()

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

Solution (Python):
def answer(s: str) -> str:
    return 'yes' if len(s) == len(set(s)) else 'no'


def main():
    s = input()
    print(answer(s))


if __name__ == '__main__':
    main()

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

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

Solution (Python):
s = list(map(str, input()))

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

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

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

if all(x == 1 for x in c.values()):
    print('yes')
else:
    print('no')

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

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



if __name__ == '__main__':
    main()

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



if __name__ == '__main__':
    main()

Solution (Python):
s = input()
s = sorted(s)
dif = True
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        dif = False
print("yes" if dif else "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)) :
  for j in range(i+1,len(S)) :
    if S[i]==S[j] :
      print("no")
      exit()
print("yes")

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

Solution (Python):

import sys

YES = "yes"  
NO = "no"  


def solve(S: str):
    s = set()
    for i in S:
        if i in s:
            print(NO)
            return
        s.add(i)
    print(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):
l = list(input())
s = set(l)
if len(s) == len(l):
	print("yes")
else:
	print("no")

Solution (Python):
s = input()

lst1 = []
for i in range(len(s)):
   lst1.append(s[i])
lst1.sort()

lst2 = list(set(lst1))
lst2.sort()

if lst1 == lst2:
   print('yes')
else:
   print('no')

Solution (Python):
S = str(input())
data1 = []
for i in range(len(S)):
    data1.append(S[i])
data2 = list(set(data1))

if len(data1) == len(data2):
    print('yes')
else:
    print('no')

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

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

Solution (Python):
s = input()
bool = True
for i in range(len(s) - 1):
    for j in range(i + 1,len(s)):
        if s[i] == s[j]:
            bool = False
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 = list(input())

for i in s:
    if s.count(i) > 1:
        print('no')
        break
else:
    print('yes')

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

Solution (Python):
s = input()
x = 0
for i in s:
  c = 0
  for j in s:
    if i == j:
      c += 1
  if c != 1:
    print("no")
    break
  else:
    x += 1
    if x == len(s):
      print("yes")
      break

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

Solution (Python):

S = str(input())

list = []
ans = 'yes'
for s in S:
    for past in list:
        if s == past: 
            ans = 'no'
            break
    if ans == 'no': break
    list.append(s)

print(ans)

Solution (Python):

import sys
input=sys.stdin.readline

def main():
    s = input().rstrip()
    string_dict={}

    for i in s:
        if i not in string_dict:
            d = {i:1}
            string_dict.update(d) 
        else:
            print("no")
            exit()
    print("yes")

if __name__=="__main__":
    main()

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

def main():
    s = input()

    s_s = set(s)

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


if __name__ ==  "__main__":
    main()

Solution (Python):

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

Solution (Python):
s = input()
l = []
for i in range(len(s)):
    if not s[i] in l:
        l.append(s[i])
    else :
        print('no')
        exit()
print('yes')

Solution (Python):
S=list(input())
S.sort()
count = 0
for i in range(len(S)-1):
    if S[i] == S[i+1]:
        count += 1

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

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

Solution (Python):
import sys
import copy
import math
import itertools
import numpy as np

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

print("yes")

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

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

Solution (Python):
S = list(input())
dic = {}

ans = True
for i in range(len(S)):
    if S[i] in dic:
        ans=False
        break
    else:
        dic[S[i]]=0

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

Solution (Python):
s = list(input())
while s:
    c = s.pop()
    if c in s:
        print('no')
        exit()
print('yes')

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

Solution (Python):
s = str(input())
L = []
for i in s:
  if i in L:
    print('no')
    exit()
  else:
    L.append(i)
print('yes')

Solution (Python):
S = input()
A = [0 for i in range(26)]
f = 0
for i in range(len(S)):
  a = ord(S[i]) - 97
  if A[a] != 0:
    print("no")
    f = 1
    break
  else:
    A[a] = 1
if f == 0:
  print("yes")

Solution (Python):


a=input()

c=[]
for i in a:
   c.append(i)




d=set(c)

if len(d)<len(c):
    print("no")
else:
    print("yes")

Solution (Python):
data=list(input())
c=0
for i in range(0,len(data)-1):
    for j in range(i+1,len(data)):
        if data[i]==data[j]:
            c=c+1
if c==0:
    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 defaultdict
import sys
s = input()
n = len(s)
dic = defaultdict(int)

for i in range(n):
    dic[s[i]] += 1
    if dic[s[i]]==2:
        print("no")
        sys.exit()

print('yes')

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

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

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

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


if __name__ == "__main__":
    main()

Solution (Python):
def main():
    s = input()
    answer = 'yes'

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


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
print('yes' if len(list(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=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):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

s = input().strip()
a = set()
for i in s:
    if i in a:
        print('no')
        sys.exit()
    a.add(i)
print('yes')

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

s = input().strip()

from collections import Counter
c = Counter(s)
if set(list(c.values())) == {1}:
    print('yes')
else:
    print('no')

Solution (Python):

S = input()
s = set()
ans = 'yes'
for i in range(len(S)):
    if S[i] in s:
        ans = 'no'
        break
    s.add(S[i])
print(ans)

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

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

Solution (Python):
S = input()

def duplicate(seq):
    seen = []
    unique = [x for x in seq if x not in seen and not seen.append(x)]
    return len(seq) != len(unique)

if duplicate(S):
    print('no')
else:
    print('yes')

Solution (Python):
a=[0]*26
S=input()
i=0
while True:
    if i==len(S):
        print("yes")
        break
    b=ord(S[i])-97
    if a[b]==1:
        print("no")
        break
    else:
        a[b]=1
        i+=1

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

Solution (Python):
s = input()
alphabet = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"]
aa = [0]*26
ans = "yes"
for i in range(len(s)):
    for j in range(26):
        if s[i] == alphabet[j]:
            aa[j] += 1
            if aa[j] >= 2:
                ans = "no"
                break
print(ans)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = input()

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

if __name__ == '__main__':
    main()

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

Solution (Python):
s = input()
a = ""
for i in s:
    if a.find(i) == -1:
        a += i
    else:
        print("no")
        break
else:
    print("yes")

Solution (Python):

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

Solution (Python):
S = input()

n1 = len(S)
n2 = len(set(S))

if n1 == n2: print('yes')
else: print('no')

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

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

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

Solution (Python):
S = input()
T = sorted(S)
U = set(T)
U = sorted(U)
if T == U:
  print('yes')
else:
  print('no')

Solution (Python):
s=str(input())
t=[]
t.append(s[0])
for i in range(1,len(s)):
  if s[i] in t:
    print("no")
    exit()
  t.append(s[i])

print("yes")

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

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

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

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

Solution (Python):
from typing import List


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

Solution (Python):

from collections import Counter

S = input()
count = Counter(S)

for cnt in count.values():
    if cnt != 1:
        print('no')
        exit()
else:
    print('yes')

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

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

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

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

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    s = s_input()

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

if __name__ == '__main__':
    main()

Solution (Python):
s = input()

st = set()
for c in s:
    if c in st:
        print("no")
        exit()
    st.add(c)

print("yes")

Solution (Python):


str = input()
count = 0
table = list(str)
for i in range(len(str) - 1):
    for j in range(i+1, len(str)):
        if table[i] == table[j]:
            count += 1
if count == 0:
    print("yes")
else:
    print("no")

Solution (Python):
s = input()
word = []

for i in s:
    if (i not in word):
        word.append(i)
    else:
        print('no')
        exit()

print('yes')

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

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

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

Solution (Python):
S = input()
tmp = []
ans = "yes"

for i in range(len(S)):
  if (S[i] in tmp):
    ans = "no"
    break
  else:
    tmp.append(S[i])
print(ans)

Solution (Python):
LI = lambda: list(map(int, input().split()))

S = input()


def main():
    n = len(S)
    sn = len(set(S))
    ans = "yes" if sn == n else "no"
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
s = input()

visited = [False] * 26
flg = True
for i in range(len(s)):
    x = ord(s[i]) - 97
    if visited[x]:
        flg = False
        break
    visited[x] = True
print('yes') if flg else print('no')

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

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

print("yes")

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

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

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

for s in S:
  if S.count(s)>1:
    print('no')
    exit()
print('yes')

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

Solution (Python):
S = input()

l=[]
ans = "yes"

for i in S:
    if i in l:
        ans = "no"
        break
    else:
        l.append(i)

print(ans)

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

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

Solution (Python):
from collections import Counter

s = list(input())

counter = Counter(s)



for k, v in counter.items():
    if v > 1:
        print("no")
        exit()
print("yes")

Solution (Python):
from collections import Counter

s=input()

n=len(Counter(s))

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

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

Solution (Python):


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

Solution (Python):
S=input()
chars = []
for c in S:
    chars.append(c)

ans = len(S) == len(set(chars))

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

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

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

Solution (Python):
s = str(input())
cnt_flag = False

for s_find in s:
	if s.count(s_find)>1:
		cnt_flag = True

if cnt_flag:
	print("no")

else:
	print("yes")

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

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

ss = list(input()[:-1])

ss.sort()

a = s(ss)

for i in range(len(a)):
    if a[i][1] >= 2:
        print("no")
        break
else:
    print("yes")

Solution (Python):
S = list(input())
r = 'yes'
for t in S:
  if S.count(t) > 1:
    r = 'no'
    break
print(r)

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

def main():
    S = input()

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
S = input()
alpha = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z',]
ex = [0]*26
for i in range(len(S)) :
    index = alpha.index(S[i])
    ex[index] += 1
    if ex[index] != 1 :
        print('no')
        exit()

print('yes')

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

Solution (Python):
S = input()

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

Solution (Python):
from collections import Counter
S = input()
l = []
for i in range(len(S)):
    l.append(S[i])
c = Counter(l)
if len(c) == len(S):
    print("yes")
else:
    print("no")

Solution (Python):

S = input()

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

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

Solution (Python):

import sys
data = list(input())

for i in range(len(data)):
  for j in range(i+1, len(data)):
    if (data[i] == data[j]):
      print("no")
      sys.exit()
    else:
      continue
else:
  print("yes")

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

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

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

Solution (Python):
s = input()

for w in s:
  cnt = s.count(w)
  if cnt > 1:
    ans = 'no'
    break
  else:
    ans = 'yes'
    
print(ans)

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

flag = 0
for i in S:
    if S.count(i)>1:
        flag = 1
        
if flag == 0:
    print('yes')
else:
    print('no')

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

Solution (Python):

def resolve():
    import sys
    input = sys.stdin.readline
    
    
    s = input().rstrip()
    chars = set()
    for c in s:
        if c in chars:
            print("no")
            return
        else:
            chars.add(c)

    print("yes")




if __name__ == "__main__":
    resolve()

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

Solution (Python):
import collections
a = input()
b = []
c = int(len(str(a)))

for i in range(c):
  b.append(a[i])

d = collections.Counter(b)
e = d.most_common()[0][1]

if e != 1:
  print("no")
else:
  print("yes")

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

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

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")
      break
  else:
    continue
  break
else:
  print("yes")

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

Solution (Python):
def resolve():
    '''
    code here
    '''
    S = [item for item in input()]
    if len(S) == len(set(S)):
        print('yes')
    else:
        print('no')


if __name__ == "__main__":
    resolve()

Solution (Python):
s = str(input())
dic = {}
for i in s:
    dic.setdefault(i,0)
    dic[i] += 1
if max(dic.values())>=2:
    print('no')
else:
    print('yes')

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

Solution (Python):

S = list(input())

S_set = set(S)

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

s = rr()
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()
n = len(s)
ok = True
for i in range(n):
    cnt = s.count(s[i])
    if cnt > 1:
        ok = False

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

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

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

Solution (Python):
s = input()
n = [0]*26
for e in s:
  n[ord(e)-ord('a')]+=1
for i in n:
  if i>1:
    print("no")
    exit()
print("yes")

Solution (Python):
S = input()
s = [True] * 26
for i in range(len(S)):
    if s[ ord(S[i]) - 97 ]:
        s[ ord(S[i]) - 97 ] = False
    else:
        print('no')
        exit()
print('yes')

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

p = { 'a': 0, 'b': 0, 'c': 0, 'd': 0, 'e': 0, 'f': 0, 'g': 0, 'h': 0, 'i': 0, 'j': 0, 'k': 0, 'l': 0, 'm': 0, 'n': 0, 'o': 0, 'p': 0, 'q': 0, 'r': 0, 's': 0, 't': 0, 'u': 0, 'v': 0, 'w': 0, 'x': 0, 'y': 0, 'z': 0,}

for e in s:
    p[e] += 1
    if p[e] == 2:
        print('no')
        sys.exit()

print('yes')

Solution (Python):
S=input()
l=[]
for i in S:
  if i in l:
    print("no")
    break
  else:
    l.append(i)
else:
  print("yes")

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

Solution (Python):
S = input()
flag = True

if S.count('a') >= 2:
  flag = False
elif S.count('b') >= 2:
  flag = False
elif S.count('c') >= 2:
  flag = False
elif S.count('d') >= 2:
  flag = False
elif S.count('e') >= 2:
  flag = False
elif S.count('f') >= 2:
  flag = False
elif S.count('g') >= 2:
  flag = False
elif S.count('h') >= 2:
  flag = False
elif S.count('i') >= 2:
  flag = False
elif S.count('j') >= 2:
  flag = False
elif S.count('k') >= 2:
  flag = False
elif S.count('l') >= 2:
  flag = False
elif S.count('m') >= 2:
  flag = False
elif S.count('n') >= 2:
  flag = False
elif S.count('o') >= 2:
  flag = False
elif S.count('p') >= 2:
  flag = False
elif S.count('q') >= 2:
  flag = False
elif S.count('r') >= 2:
  flag = False
elif S.count('s') >= 2:
  flag = False
elif S.count('t') >= 2:
  flag = False
elif S.count('u') >= 2:
  flag = False
elif S.count('v') >= 2:
  flag = False
elif S.count('w') >= 2:
  flag = False
elif S.count('x') >= 2:
  flag = False
elif S.count('y') >= 2:
  flag = False
elif S.count('z') >= 2:
  flag = False

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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


def main():
    s = input()
    d = set()
    for c in s:
        if c in d:
            print("no")
            return
        d.add(c)
    print("yes")

if __name__ == "__main__":
    main()

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

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

SS = [0] * 26

lis = [chr(i) for i in range(97, 97 + 26)]

for S in S:
    ind = lis.index(S)
    if SS[ind] == 0:
        SS[ind] = 1
    else:
        print("no")
        break
else:
    print("yes")

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

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

Solution (Python):









ans = [0] * 26

s = input()

for i in range(len(s)):
    idx = ord(s[i]) - 0x61
    ans[idx] += 1
    if (ans[idx] > 1):
        print("no")
        exit()
print("yes")

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

Solution (Python):
s = list(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):
import collections
Sls = list(input())
counter = collections.Counter(Sls)
ans = 'yes'
for i in counter.values():
    if i > 1:
        ans = 'no'
        break
print(ans)

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

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

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

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

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

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

Solution (Python):
S = input()

mem = {}

for c in S:
    if c in mem.keys():
        print('no')
        exit()
    else:
        mem[c] = 1
print('yes')

Solution (Python):
str1 = input()
li = list(str1)
flag = False
for i in range(len(li)):
    a = i+1
    x = li[i]
    while a < len(li):
        if x == li[a]:
            flag = True
            break
        a += 1
    if flag:
        break
if flag:
    print('no')
else:
    print('yes')

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

Solution (Python):
S = str(input())
a = []
for i in range(len(S)):
  if S[i] in a:
    print("no")
    quit()
  else:
    a.append(S[i])
    
    
print("yes")

Solution (Python):
s=list(input())
n=len(s)
l=list("abcdefghijklmnopqrstuvwxyz")
f=0
for i in range(26):
    if s.count(l[i])>=2:
        f=1
print("yes" if f==0 else "no")

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

Solution (Python):
def varied(s):
	for i in range(1, len(s)):
		if s[i-1] in s[i:]:
			return "no"
	return "yes"

s = input()
print(varied(s))

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

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