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-----
uncopyrightable

-----Sample Output-----
yes


Difficulty: introductory

Starter code:

Solutions:
import sys, math
from itertools import combinations as c, product as p
from collections import deque
sys.setrecursionlimit(10**9)
INF = float('inf')
MOD = 10**9 + 7
#MOD = 998244353


def si(): return input()
def ii(): return int(input())
def fi(): return float(input())
def lstr(): return input().split()
def lint(): return list(map(int, input().split()))
def lintdec(): return list(map(lambda x:int(x) - 1, input().split()))
def lnstr(n): return [input() for _ in range(n)]
def lnint(n): return [int(input()) for _ in range(n)]
def lint_list(n): return [lint() for _ in range(n)]



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

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

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

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

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

print("yes")

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

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


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



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

s = input()
res = "yes"
for i in range(len(s)):
  for j in range(i+1,len(s)):
    if s[i] == s[j]:
      res = "no"
print(res)

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

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



def __starting_point():
    main()

__starting_point()

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


s = list(map(str, input()))

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


s = [c for c in input()]

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

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

print("yes")

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

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

# ABC063
from collections import Counter

S = input()
count = Counter(S)

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

#-*-coding:utf-8-*-
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")
            return
    print("yes")

def __starting_point():
    main()
__starting_point()

# 31
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)

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

S = input()

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

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

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

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

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


S = input()


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

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

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

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

# 「ABC-154-C」の類題
S = input()
 
n1 = len(S)
n2 = len(set(S))
 
if n1 == n2: print('yes')
else: print('no')

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

S = input()
ans = ""

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

print(ans)


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


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

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

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


def __starting_point():
    main()

__starting_point()

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

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

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


from collections import Counter

string = Counter(input())

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

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

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

from collections import deque
d = deque()
for s in input():
  if s in d:
    print('no')
    return
  else: 
    d.append(s)
print('yes')

# -*- coding:utf-8 -*-
S = input()

past = []
ans = "yes"

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

print(ans)


s = input()
word = []

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

print('yes')


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

import sys
S = input()

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

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

s=input()
t=set()
for x in s:
  if x in t:
    print('no')
    return
  else:
    t.add(x)
print('yes')

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

S = input()

for i in range(len(S)):
    if S[i] in S[i+1:]:
        print('no')
        break
else:
    print('yes')

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

from typing import List


S = list(input())  # type: List[str]
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')


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



def __starting_point():
    main()

__starting_point()

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


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

S=input()
for i in range(len(S)) :
  for j in range(i+1,len(S)) :
    if S[i]==S[j] :
      print("no")
      return
print("yes")

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

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


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

# import math
# import statistics
a=input()
#b,c=int(input()),int(input())
c=[]
for i in a:
   c.append(i)
#e1,e2,e3,e4 = map(int,input().split())
#f = list(map(int,input().split()))
#g = [input() for _ in range(a)]

d=set(c)

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

#n = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
s = list(input())
if len(s) == len(set(s)):
    print('yes')
else:
    print('no')


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


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

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

S=input()
a=[0]*26
num=ord('a')
for i in range(len(S)):
    tmp=ord(S[i])-num
    if a[tmp]:
        print('no')
        break
    a[tmp]=1
else:
    print('yes')


s = str(input())

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

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

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

print('yes')

S = list(input())

S.sort()

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



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

s = str(input())

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

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

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

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

S = input()

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

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

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

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


# coding: utf-8

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

s = input()

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

print("yes")


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)

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


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


def __starting_point():
    main()
__starting_point()

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

s=input()
for i in s:
  if s.count(i) != 1:
    print("no")
    return
print('yes')

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

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


s = list(input())
n = len(s)
s = set(s)
nn = len(s)

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

import collections
s = input()
c = collections.Counter(s)

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

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

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

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

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

s = input()

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

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

s = list(input())

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


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