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()
check = True

for i in range(len(s)):
    for j in range(len(s)):
        if((i != j) and (s[i] == s[j])):
            check = False

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

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

Solution (Python):
def solve():
    S = input()
    alpha_map = {}
    for c in S:
        if not c in alpha_map.keys():
            alpha_map[c] = 1
        else:
            alpha_map[c] = alpha_map[c] + 1
    if any(x > 1 for x in alpha_map.values()):
        print("no")
    else:
        print("yes")

solve()

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

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

def check(s):
  for i in range(len(s)):
    if s[i] in checked:
      return 'no'
    else:
      checked.append(s[i])
  return 'yes'
print(check(s))

Solution (Python):
s = input()

list = []
count = 0

for i in range(len(s)):
	list.append(s[i])
	
for j in range(len(s)):
	if s.count(list[j]) >= 2:
		print('no')
		break
	if s.count(list[j]) == 1:
		count += 1
	if count == len(s):
		print('yes')
		break

Solution (Python):
s = input()
y = True
for i in range(len(s)):
    for j in range(len(s)):
        if(i != j and s[i] == s[j]):
            y = False
if(y):
    print("yes")
else:
    print("no")

Solution (Python):
alphabet = [chr(i) for i in range(97, 97+26)]
val = input()

res = 0
for i in alphabet:
    if val.count(i) > 1:
        res = -1
        break
print("yes" if res == 0 else "no")

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

Solution (Python):
S = raw_input()
lis = list(S)
mat = []
for i in lis:
	if i in mat:
		print "no"
		break
	mat.append(i)
else:
	print "yes"

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

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

Solution (Python):
from collections import Counter


def solve():
    s = list(input())
    counter = Counter(s)

    if counter.most_common()[0][1] == 1:
        print("yes")
    else:
        print("no")


solve()

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

Solution (Python):
dp = [False]*26

ans = "yes"
for c in input():
    tmp = ord(c) - 97
    if dp[tmp]:
        ans = "no"
        break
    else:
        dp[tmp] = True
print(ans)

Solution (Python):
S = sorted(list(raw_input()))
for i in xrange(len(S) - 1):
    if S[i] == S[i + 1]:
        print "no"
        exit()
print "yes"

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

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

Solution (Python):
s = raw_input()
s_list = [item for item in s]

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

Solution (Python):
S = input()
cnt = {}
res = True
for c in S:
  if c not in cnt:
    cnt[c] = 1
  else:
    res = False

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

Solution (Python):

"""
http://abc063.contest.atcoder.jp/tasks/abc063_b

"""
import sys
from sys import stdin
input = stdin.readline


def main(args):
    ans = 'yes'
    S = input().strip('\n')

    alphabet = dict()
    for c in S:
        if c in alphabet:
            ans = 'no'
            break
        else:
            alphabet[c] = 1

    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

Solution (Python):
S = input()
sort = sorted(S)
t = sort[0]
jurge = 'yes'
for w in sort[1:]:
    if t == w:
        jurge = 'no'
        break
    else:
        t = w
if jurge == 'yes':
    print('yes')
else:
    print('no')

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

Solution (Python):
S = input()

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

Solution (Python):
S = input()
N = [i for i in S]
N2 = set(N)
if len(N) == len(N2):
    print('yes')
else:
    print('no')

Solution (Python):



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

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

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

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

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

Solution (Python):
S = input()
set_S = set(S)
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):
def main():
    alpha = [0 for i in range(ord('z')+1)]

    flag = 1
    for s in input():
        if alpha[ord(s)] == 1:
            flag = 0
            break
        alpha[ord(s)] = 1

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


if __name__ == "__main__":
    main()

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

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

print('yes')

Solution (Python):
s = input()
chars = []
ans = "yes"
for c in s:
    if(c not in chars):
        chars.append(c)
    else:
        ans = "no"
        break

print(ans)

Solution (Python):
str=input()
flag=True
for i in range(len(str)):
    if str.count(str[i])!=1:
        flag=False
        break
if flag:
    print("yes")
else:
    print("no")

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

Solution (Python):
S = input()

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

Solution (Python):
S = input()

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

Solution (Python):
a = input()
ls = {}
for i in range(ord('a'), ord('z') + 1):
    ls[chr(i)] = 0

for i in a:
    ls[i]+=1;

f = 1;
for i in a:
    if ls[i] > 1:
        f = 0
        break
if f:
    print("yes")
else:
    print("no")

Solution (Python):



import sys
import re
import math
import collections
import itertools
import functools

DEBUG = True
DEBUG = False

def dbg(*args):
    if DEBUG:
        print("DBG: ", file=sys.stderr, end="")
        print(*args, file=sys.stderr)



def main():
    s = input();
    yes = len(set(s)) == len(s)
    print("yes" if yes else "no")

if __name__ == "__main__": main()

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

c = collections.Counter(s)
for k, v in c.items():
    if v != 1:
        count += 1
if count == 0:
    print("yes")
else:
    print("no")

Solution (Python):
S = input()

ans_flag = True
for i in range(len(S)):
    if S.count(S[i]) != 1:
        ans_flag = False
        break

if ans_flag == True:
    print("yes")
    
else:
    print("no")

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

index = 0
for i in range(len(S)):
    if S[i] in S[(i+1):]:
        index += 1
    else:
        index += 0

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

Solution (Python):
word = input().rstrip()
for i in range(len(word)):
    if word[i] in word[i+1:]:
        print('no')
        exit()
print('yes')

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

Solution (Python):
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(input())
def pli(a): return "".join(list(map(str, a)))

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

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

Solution (Python):
word = input()
for i in range(len(word)):
    result = word.count(word[i:i+1])
    if result > 1:
        break
    
if result > 1:
    print("no")
    
else:
    print("yes")

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

Solution (Python):
s = input()

str=[]
for char in s:
    str.append(char)

str.sort()

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

Solution (Python):
def read_line():
    return input().rstrip()

def read_ints():
    return [int(x) for x in read_line().split()]

def read_int():
    return int(read_line())


s = read_line()
l = len(s)

u = len(set(s))

if l == u:
    print('yes')
else:
    print('no')

Solution (Python):
from collections import defaultdict


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


if __name__ == '__main__':
    main()

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

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

if len(s) < 2 or len(s) > 26:
    quit()
if len(s) >= 2 and len(s) <= 26:
    s2 = ''.join(sorted(s))
    for i in s2:
        if c+1 >= len(s):
            break
        elif s2[c] == s2[c+1]:
             print('no')
             quit()
        else:
            c = c + 1
print('yes')

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

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

dejavu = []
Yes = True

for s in S:
    if s in dejavu:
        Yes = False
        break
    else:
        dejavu.append(s)

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

Solution (Python):
arr = []
s = input()
for i in s:
    if i not in arr:
        arr.append(i)
    elif i in arr:
        print("no")
        break
if len(arr) == len(s):
    print("yes")

Solution (Python):


s = input()
ss = list(set(s))

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

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

Solution (Python):
import sys

S = str(input())

a = set()
for k in S:
  if (k in a):
    print('no')
    sys.exit()
  a.add(k)

print('yes')

Solution (Python):


S = list(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):
from collections import Counter

print('yes' if all([True if x <= 1 else False for x in list(Counter(input()).values())]) else 'no')

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

Solution (Python):
S = raw_input()
a = [0 for i in range(len(S))]
flag = 0

for i in range(len(S)):
	a[i] = S[i]
	for j in range(i):
		if a[j] == S[i]:
			print "no"
			flag = 1
			break
	if flag == 1:
		break

if flag == 0:
	print "yes"

Solution (Python):
import sys

s = raw_input()

arr = []

temp = ord(s[0])
arr.append(temp)

for i in range(1, len(s)):
    temp = ord(s[i])
    if temp in arr:
        print "no"
        break
    else:
        temp = ord(s[i])
        arr.append(temp)
    if i == len(s) - 1:
        print "yes"

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

Solution (Python):


import sys
import subprocess
import json
import time
import math
import re
import sqlite3


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

Solution (Python):


import sys
import subprocess
import json
import time
import math
import re
import sqlite3


S = input()
dic = {}
for c in S:
    if c in dic:
        print("no")
        exit(0)
    dic[c] = 1
print("yes")

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

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

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

for i in S:
    if i in saw:
        print('no')
        sys.exit()
    else:
        saw.append(i)
print('yes')

Solution (Python):
s = input()
l = [0]*26
for c in s:
	idx = int(ord(c) - ord('a'))
	if l[idx] > 0:
		print("no")
		quit()
	else:
		l[idx] += 1
print("yes")

Solution (Python):
import sys

S = input()

saw = []

for i in S:
    if i in saw:
        print('no')
        sys.exit()
    else:
        saw.append(i)

print('yes')

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

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

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

Solution (Python):


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

Solution (Python):

a = input()
flag = False
dict = {}
for b in a:
  if b in dict:
    flag = True
    break
  dict[b] = 1

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

Solution (Python):
s = raw_input()
r = set()
r.update(s)

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

Solution (Python):

S = input()

s = set([e for e in S])

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

Solution (Python):
from collections import Counter
arg = input()

counter = Counter(arg)
if(max(counter.values()) > 1):
    print("no")
else:
    print("yes")

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

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

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

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

Solution (Python):
s = list(input())
a , b = len(s) , len(set(s))

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

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

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

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

Solution (Python):

N=input()

s=list(N)


m=set(N)

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

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

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

string = 'abcdefghijklmnopqrstuvwxyz'
x = 0

for moji in string:
	if S.count(moji) >= 2:
		x = 1

print("no" if x == 1 else "yes")

Solution (Python):
S = input('')
string = 'abcdefghijklmnopqrstuvwxyz'
x = 0

for moji in string:
	if S.count(moji) >= 2:
		x = 1	

print("no" if x == 1 else "yes")

Solution (Python):
from collections import Counter
import sys



s = input()
n = len(s)

res = 'yes'
for i in range(0, n):
    for j in range(i + 1, n):
        if s[i] == s[j]:
            res = 'no'

print(res)

c = Counter(s)
res = 'yes'
for l, value in c.items():
    if value > 1:
        res = 'no'

Solution (Python):




S = list(input())



S_uniq = list(set(S))



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

Solution (Python):


def main():
    s = raw_input()

    for i, c in enumerate(list(s)):
        
        
        if s.rfind(c)!=i:
            print 'no'
            return 0
            
    print 'yes'

if __name__ == '__main__':
    main()

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

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

Solution (Python):


in_str = input()
flag = True

for i in range(0, len(in_str)):
  for j in range(i+1, len(in_str)):
    if in_str[i] == in_str[j]:
      print("no")
      flag = False
      break
  if flag == False:
    break

if flag == True:
  print("yes")

Solution (Python):
import sys

s = list(input())

check_array = [0 for i in range(26)]

for i in range(len(s)):
    judge = s[i]
    
    for j in range(len(s)):
        if judge == check_array[j]:
            print("no")
            sys.exit()
    
    check_array[i] = judge

print("yes")

Solution (Python):
def is_duplicated():
	S = list(input())
	S_n = list(set(S))
	if len(S) != len(S_n):
		print('no')
		return
	print('yes')

is_duplicated()

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

S_uni = list(set(S))

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

Solution (Python):



import sys
input_line2 = sys.stdin.readline()

flag = 0
for i in range(len(input_line2)):
    for j in range(len(input_line2)):
        if i != j:
            if input_line2[i] == input_line2[j]:
                flag = 1
                break;

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

Solution (Python):
str = input()
dict = {}
flag = False
for c in str:
    if c in dict:
        flag = True
    dict[c] = 1
if flag:
    print('no')
else:
    print('yes')

Solution (Python):
import re; print('no' if re.match(r'.*(.).*\1.*', input()) else 'yes')

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

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

Solution (Python):
import sys, collections

s = input()

a = 1

cnt = collections.Counter(s)

for i,j in cnt.items():
	if j != 1:
		a = 0
		break

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

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

Solution (Python):

input_lines=raw_input()
length=len(input_lines)
result = True

for i in xrange(length):
    for j in range(i+1,length):
        if input_lines[i]==input_lines[j]:
            result = False
            break
    if result == False:
        break


if result:
    print "yes"
else:
    print "no"

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

Solution (Python):
words = input()
answer = "yes"
for word in words:
    if words.count(word) > 1:
        answer = "no"
        break
print(answer)

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

for i in s:
    if i not in arr:
        arr.append(i)
    elif i in arr:
        print("no")
        break

if len(arr) == len(s):
    print("yes")

Solution (Python):
import sys
S = [i for i in input()]

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

print('yes')

Solution (Python):
S = input()

s = set(S)

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

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

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

Solution (Python):

S = str(raw_input())

string = list(S)

n = 0
for char in string:
    if S.count(char) >= 2:
        print("no")
        break
    else:
        n += 1
        if n == len(S):
            print("yes")

Solution (Python):
if __name__ == "__main__":
    S = input()

    result = "yes"
    
    for c in S:
        
        if S.count(c) > 1:
            result = "no"
            break

    print(result)

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

Solution (Python):
import re; print('no' if re.match(r'.*(.).*\1.*', input()) else 'yes')

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

Solution (Python):
s = raw_input()
l = len(s)
dif = True
for i in range(l):
    for j in range(i+1,l):
        if s[i] == s[j]:
            dif = False
            break
    if not dif:
        break
if dif:
    print 'yes'
else:
    print 'no'

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

Solution (Python):
S = input()

s_set = set(S)

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

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

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

Solution (Python):
def B():
    from numpy import zeros
    s = input()
    r = zeros((26,), dtype='int32')
    ord_a = ord('a')
    for c in s:
        r[ord(c)-ord_a] += 1
    for i in r:
        if i > 1:
            print('no')
            exit()
    print('yes')

B()

Solution (Python):
s = input()
Chars = [l for l in s]
Depre = set(Chars)

if len(Chars) == len(Depre):
	print('yes')
else:
	print('no')

Solution (Python):
S=input()
tmp=[S[i] for i in range(len(S))]

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

Solution (Python):
s=input();print('no'*(len(set(s))<len(s))or'yes')

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

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

ans = "yes"

l.sort()

for i in range(len(s)-1):
    if l[i] == l[i+1]:
        ans = "no"
        break

print ans

Solution (Python):


S = input()

S_list = [ S[i] for i in range(len(S)) ]

S_uniq = list(set(S_list))

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

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

def main():
    s = S()
    d = collections.defaultdict(int)
    for c in s:
        d[c] += 1

    if max(d.values()) == 1:
        return 'yes'
    return 'no'


print(main())

Solution (Python):
def solve():
    s=input()
    num = [0 for i in range(26)]
    for i in range(len(s)):
        num[ord(s[i])-ord('a')]+=1;
    for i in range(26):
        if num[i]>1:
            print("no")
            return
    print("yes")
if __name__ == "__main__":
    solve()

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

Solution (Python):
a=input("")
c=""
b={}.fromkeys(a).keys()
for i in b:
    c+=str(i)
if len(a)==len(c):
    print("yes")
else:print("no")

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

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

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

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

Solution (Python):


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

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

Solution (Python):
import sys

def solve():
    s = input()
    ss = set(s)

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

if __name__ == '__main__':
    solve()

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

Solution (Python):

S = list(input())
S.sort()
if ''.join(S) == ''.join(sorted(list(set(S)))):
    print("yes")
else:
    print("no")

Solution (Python):


S = input()
list(S)
boolean = True
for i in range(len(S)):
    for j in range(i+1, len(S)):
        if S[i] == S[j]:
            boolean = False

[print('no') if boolean == False else print('yes')]

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

res='yes'

for i in range(len(s)):
    c=s[i]
    if s.count(c)>1:
        res='no'
        
print(res)

Solution (Python):
from sys import stdin
a = stdin.readline().strip()
ans = 'yes'
if len(a)!=len(set(a)):
 ans = 'no'
print ans

Solution (Python):
from collections import defaultdict

S = str(input())
sentence_dict = defaultdict(int)

for alpha in S:
    sentence_dict[alpha] += 1

count = 0
for i in sentence_dict.values():
    if i == 1:
        count += 1
        if count == len(sentence_dict):
            print("yes")
    else:
        print("no")
        break

Solution (Python):
S=list(input())
S.sort()
nd=0
i=0
while nd==0 and i<len(S)-1:
    if S[i]==S[i+1]:
         nd=1
    i+=1
if nd==1:
    print ("no")
else:
    print ("yes")

Solution (Python):
A=input()
B=[]
for i in range(len(A)):
    B.append(A[i])
    B.sort()
flg=0
for i in range(len(A)-1):
    if B[i]==B[i+1]:
        flg=+1
if flg>0:
    print("no")
else:
    print("yes")

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

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

Solution (Python):
String = input()

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

Solution (Python):


S = input()

S_list = []

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

S_uniq = list(set(S_list))

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

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

if __name__ == '__main__':
    main()

Solution (Python):
s = (str(input())).count
if ((s('a')>1)or(s('b')>1)or(s('c')>1)or(s('d')>1)or(s('e')>1)or(s('f')>1)
    or(s('g')>1)or(s('h')>1)or(s('i')>1)or(s('j')>1)or(s('k')>1)or(s('l')>1)
    or(s('m')>1)or(s('n')>1)or(s('o')>1)or(s('p')>1)or(s('q')>1)or(s('r')>1)
    or(s('s')>1)or(s('t')>1)or(s('u')>1)or(s('v')>1)or(s('w')>1)or(s('x')>1)
    or(s('y')>1)or(s('z')>1)):
    print('no')
else:
    print('yes')

Solution (Python):
s = input()
len_s = len(s)
duplication = False

for i in range(len_s - 1):
    for j in range(i, len_s-1):
        if s[i] == s[j+1]:
            print("no")
            duplication = True
            break
    if duplication:
        break
if not duplication:
    print("yes")

Solution (Python):
s = raw_input()
f = True
for i in xrange(len(s)-1):
    if s[i] in s[i+1:]:
        f = False
if f:
    print "yes"
else:
    print "no"

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

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

Solution (Python):


def is_unique_chars(s):
    if isinstance(s, str):
        s = s.decode('utf-8')
    return len(set(list(s))) == len(s)

S = raw_input()

if is_unique_chars(S)==True:
	print "yes"
else:
	print "no"

Solution (Python):
S = input().strip()
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()
listS = set(S)
if len(listS) is len(S):
    print('yes')
else:
    print('no')

Solution (Python):
s=str(input())
name="yes"
for i in range(len(s)):    
    for j in range(len(s)):
        if i!=j:
            if s[i]==s[j]:
                name="no"
        elif i==j:
            pass
            
print(name)

Solution (Python):
s=input()

jud=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
for i in range(len(s)):
    for j in range(26):


        if ord(s[i])==j+ord('a'):
            jud[j]+=1

a=False




for i in range(26):
    if jud[i]>=2:
        a=(jud[i]>=2)
        print("no")
        break

if a==False:
    print("yes")

Solution (Python):



def judge(str):
    for i, x in enumerate(str):
        for j, v in enumerate(str):
            if (i != j) and x == v:
                return 'no'
    return 'yes'

str = input()

if len(str) < 1 or len(str) > 27:
    print ('error')

print (judge(str))

Solution (Python):
s = input()
d =dict()

for c in s:
    if not c in d:
        d[c] = 1
    else:
        d[c] += 1

message = ""
for v in d.values():
    if v >=2:
        message = "no"
        break

if message == "no":
    print(message)
else:
    print("yes")

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

for i in range(len(a) - 1) :
  for j in range(len(a)) :
    if i + j + 1 == len(a) :
      break
    if (a[i] == a[i + j + 1]) :
      dif = 1
  
if dif :
  print ('no')
else :
  print ('yes')

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

Solution (Python):

import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    S = str(input())
    return (S,)


def solve(S):
    count = collections.Counter([char for char in S])
    for c in count.values():
        if c >= 2:
            ans = "no"
            break
    else:
        ans = "yes"
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()

Solution (Python):
s = raw_input()

ans = "yes"

for i in s:
    if s.count(i) != 1:
        ans = "no"

print ans

Solution (Python):
S = input()

j = 0
for s in S:
    if S.count(s) >= 2:
        j += 1

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

Solution (Python):




line =raw_input()

Slist = list(line)


k = set(Slist)

if len(Slist) == len(k) and 2<= len(Slist) <=26:
    print 'yes'
else:
    print 'no'

Solution (Python):
arr = [0 for x in range(125)]
S = input()
for s in S:
   if arr[ord(s)] == 1:
      print("no")
      break
   else:
      arr[ord(s)] = 1
else:
   print("yes")

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

Solution (Python):
a=raw_input()
b=len(a)
c=0
for i in range(b):
    for j in range(i+1,b):
        if a[i]==a[j]:
            c+=1
if c==0:
    print "yes"
else:
    print "no"

Solution (Python):

s = input()

d = dict()
a=[]
flag=0

for s_ in s:
    if s_ not in d.keys():
        d[s_]=0
    else:
        flag=1
        break
if flag==1:
    print("no")
else:
    print("yes")