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



Sample input:
uncopyrightable


Sample output:
yes

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#63b
s=input()
temp = set(s)
print('yes' if len(s)==len(temp) else 'no')

Submission status: Accepted

Solution code:
def solve():
    s = input()

    strs = {}
    for ss in s:
        if ss in strs.keys():
            print('no')
            return
        else:
            strs[ss] = 1

    print('yes')
    return

solve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=list(input())
ans="yes"
for c in s:
    if s.count(c) > 1:
        ans="no"
        break
print(ans)

Submission status: Accepted

Solution code:
# vim: set fileencoding=utf-8 :
s = str(raw_input())

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

Submission status: Accepted

Solution code:
s = str(input())

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

print(ans)

Submission status: Accepted

Solution code:
import sys
s = list(input())
s_uniq = list(set(s))
 
print('yes' if len(s) == len(s_uniq) else 'no')
 
sys.exit(0)

Submission status: Accepted

Solution code:
import sys
s = list(input())
s_uniq = list(set(s))

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

sys.exit(0)

Submission status: Accepted

Solution code:
import itertools
S = input()
for (i,j) in itertools.combinations(range(len(S)),2):
	if S[i] == S[j]:
		print("no")
		exit()
print("yes")

Submission status: Accepted

Solution code:
s = list(input())


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()
import collections
c = collections.Counter(s)
print("yes" if all(x == 1 for x in c.values()) else "no")

Submission status: Accepted

Solution code:

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

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

if __name__ == "__main__":
        main()

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

words = []

for i in range(len(S)):
    if S[i] not in words:
        words.append(S[i])

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

Submission status: Accepted

Solution code:
def solve():
    s = list(input())
    len_bf = len(s)
    len_af = len(set(s))

    if len_bf == len_af:
        print("yes")
    else:
        print("no")

solve()

Submission status: Accepted

Solution code:
s = input()
if sorted(list(s)) == sorted(list((set(s)))):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

S = list(input())

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

Submission status: Accepted

Solution code:
s=input()
cnt=[0 for i in range(26)]
for c in s:
  cnt[ord(c)-ord('a')]+=1
print('yes' if max(cnt)<2 else 'no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/env python3

s = input()
dic = {}

res = True
for c in s:
    if c in dic:
        res = False
        break
    else:
        dic[c] = True

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S=list(input())

S2=list(set(S))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
S.sort()
N = len(S)
judge = "yes"
for i in range(N - 1):
	if S[i] == S[i + 1]:
		judge = "no"
		break

print(judge)

Submission status: Accepted

Solution code:
import string
import sys

s = input()

for char in string.ascii_lowercase:
  if s.count(char) > 1:
    print('no')
    sys.exit()

print('yes')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
"""
https://abc063.contest.atcoder.jp/tasks/abc063_b
"""
s=input()
d=0
for i in range(len(s)):
    d=d+s.count(s[i])
if d==len(s):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
S = input()
cnt = 0
for i in S:
    if S.count(i) >= 2:
        cnt += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# input
S = input()

S_set = set(S)

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

Submission status: Accepted

Solution code:
# input
S = list(input())

S_set = set(S)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

S = list(input())

S2 = list(set(S))

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

Submission status: Accepted

Solution code:
s = input()
flag = 0
b = []
for i in s:
    if i in b:
        flag = 1
    b.append(i)
if flag:
    print('no')
else:
    print('yes')

Submission status: Accepted

Solution code:
S = input()

input_set = set(S)

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

Submission status: Accepted

Solution code:
from collections import Counter
s = raw_input()
c = Counter(s)
if len(c) == len(s):
  print 'yes'
else:
  print 'no'

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()
a = len(s)
b = {i for i in s}
if len(s) - len(b):
    print('no')
else :
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

for i, chari in enumerate(S):
    for j, charj in enumerate(S):
        if i!=j and chari==charj:
            print("no")
            quit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s = sys.stdin.readline().strip()
if len(s) == len(set(s)):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
S = input()
vocab = set()

for c in S:
  if c not in vocab:
    vocab.add(c)
  else:
    print('no')
    exit()
print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

flag = 1
for target in s:
    count = 0
    for character in s:
        if character == target:
            count += 1
        if count >= 2:
            flag = 0
            break

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

Submission status: Accepted

Solution code:
S = input()

letters = []
for i in range(len(S)):
    if S[i] not in letters:
        letters.append(S[i])

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

Submission status: Accepted

Solution code:
e=input()
print(['yes','no'][len(e)>len(set(e))])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
flug=True
nagasa=len(S)
for i in range(nagasa):
    for k in range(1,nagasa-i):
        if S[i:i+1]==S[i+k:i+k+1]:
            flug=False
            break
if flug==True:
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
from collections import defaultdict

S=input()
dict=defaultdict(int)
for i in range(len(S)):
  dict[S[i]]+=1

ans=True
for a,b in dict.items():
  if b>1:
    ans=False
    break
if ans:
  print("yes")
else:
  print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
set = set()
for c in s:
    if(not c in set):
        set.add(c)
    else:
        print('no')
        exit()
print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input('')
ret = "yes"
for x in range(len(str)):
  for y in range(len(str)):
    if x == y:
      continue
    if str[x] == str[y]:
      ret = "no"
      break
print(ret)

Submission status: Accepted

Solution code:
s = [x for x in input()]
print('yes' if all([(s.count(c)==1) for c in s])  else 'no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = [x for x in S]
print("yes" if len(T)==len(set(T)) else "no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = input()
flag = 0
for i in range(len(string)):
    for j in range(len(string)):
        if i!=j:
            if string[i]==string[j]:
                flag = 1
                break
if flag == 0:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
s = input()
ans=0
for x in set(s):
    if s.count(x)>1:
        ans+=1
print('yes') if ans==0 else print('no')

Submission status: Accepted

Solution code:
# coding: utf-8
s = input()
ss = set(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
ans = 'yes'
for i in a:
    if a.count(i) >= 2:
        ans = 'no'
print(ans)

Submission status: Accepted

Solution code:
def a():
    S = input()
    R = set()
    for i in S:
        if i in R:
            print("no")
            return
        else:
            R.add(i)
    print("yes")
    return
            
a()

Submission status: Accepted

Solution code:
import collections
import sys

S = input()
S = list(S)

c = collections.Counter(S)
for i in c.values():
   if i >= 2:
      print('no')
      sys.exit()

print('yes')

Submission status: Accepted

Solution code:
S = input()

l = []

ans = 'yes'

for s in S:
    if s not in l:
        l.append(s)
    else:
        ans = 'no'
        break

print(ans)

Submission status: Accepted

Solution code:
S = input()
for i in S:
    if S.count(i)>1:
        print('no')
        break
else:
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
length_S = len(S)
S_short = set(S)
length_S_short = len(S_short)
if length_S == length_S_short:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# AtCoder Beginner Contest
# Problem B

if __name__ == '__main__':
    s = input()
    set_s = set(s)

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

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

s=arr_data[0][0]


arr=[]


for v in s:
    
    arr.append(v)
    
    
arr02=sorted(arr)

#print(arr02)


chkflg=True


for i in range(0,len(arr02)-1):
    
#    print(arr02[i])
    
    if arr02[i]==arr02[i+1]:
        
        chkflg=False
        
        break
        
if chkflg:
    
    print("yes")
    
else:
    
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

SS = set(list(S))

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

Submission status: Accepted

Solution code:
s=input()
chk=len(s)
ans=set([i for i in s])
print('yes' if len(ans)==chk else 'no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input();print("yneos"[len(set(s))<len(s)::2])

Submission status: Accepted

Solution code:
n = input()
lis = []
for i in range(0,len(n)):
    if n[i] not in lis:
        lis.append(n[i])
    else:
        print("no")
        break
    if i == len(n)-1:
        print("yes")

Submission status: Accepted

Solution code:
S = input()
c_s = [c for c in S]
if len(c_s) != len(set(c_s)):
    print("no")
else:
    print("yes")

Submission status: Accepted

Solution code:
S = input()
T = set()
for i in S:
    T.add(i)
if len(T)==len(S):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
seen=set()
for i in s:
	if i in seen:
		print('no')
		exit()
	seen.add(i)
print('yes')

Submission status: Accepted

Solution code:
from collections import Counter
S = input().strip()
s = Counter(S)
for k,v in s.items():
  if v>=2:
    import sys
    print('no')
    sys.exit(0)
else:
  print('yes')

Submission status: Accepted

Solution code:
s = list(input())
s_re = set(s)

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

Submission status: Accepted

Solution code:
import numpy as np
import pdb

def main():
    string = list(raw_input())
    stringset = set(string)
    if len(string) > len(stringset):
        print 'no'
    else:
        print 'yes'


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

k = list(raw_input())
counted = Counter(k)
for key, value in counted.iteritems():
    if value > 1:
        print "no"
        exit()

print "yes"

Submission status: Accepted

Solution code:

import collections

s = input()

a = any(map(lambda s: s > 1, collections.Counter(s).values()))

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

Submission status: Accepted

Solution code:
from collections import Counter
s=list(str(input()))
duplication = [i for i,v in Counter(s).items() if v>1]
print(['no','yes'][duplication ==[]])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def hikaku(S):
    for i in range(1,len(S)):
        if S[i]==S[i-1]:
            return "no"

    return "yes"


S=list(input())

S.sort()

print(hikaku(S))

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
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:])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
S=input()
import sys

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

print('yes')

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
from collections import defaultdict


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
# Varied

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
#from sets import Set
S = str(input())

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

print('yes')

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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"

Submission status: Accepted

Solution code:
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"

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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")