Problem:


Score : 200 points

Problem Statement

You are given a string S consisting of lowercase English letters.
Find the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.
If every lowercase English letter occurs in S, print None instead.

Constraints

1 \leq |S| \leq 10^5 (|S| is the length of string S.)

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

Print the lexicographically smallest lowercase English letter that does not occur in S.
If every lowercase English letter occurs in S, print None instead.

Sample Input 1

atcoderregularcontest

Sample Output 1

b

The string atcoderregularcontest contains a, but does not contain b.

Sample Input 2

abcdefghijklmnopqrstuvwxyz

Sample Output 2

None

This string contains every lowercase English letter.

Sample Input 3

fajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg

Sample Output 3

d



Sample input:
atcoderregularcontest


Sample output:
b

Submission status: Wrong Answer

Solution code:
S=sorted(set(input()))
i = 0
tf = True
for s in S:
  if s == chr(ord('a')+i):
    i+=1
    continue
  else:
    print(chr(ord('a')+i))
    tf = False
    break
if tf:
  print('None')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
s = sorted(map(ord, set(input())))
alp = ord('a')

for c in s:
    if c == alp:
        if c == ord('z'):
            break
        alp += 1
        continue
    else:
        print(chr(alp))
        quit()
print('None')

Submission status: Wrong Answer

Solution code:
import sys, re
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from collections import deque, defaultdict, Counter
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop, heapify
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

ans = list(ascii_lowercase)
print(ans)

for x in S:
	if x in ans:
		ans.remove(x)

if ans == []:
	print("None")
else:
	print(ans[0])

Submission status: Wrong Answer

Solution code:
S=list(input())
l=sorted(list(set(S)))
for (i,j) in zip(range(len(l)),range(97,97+26)):
        if chr(j) !=l[i]:
            print(chr(j))
            exit()
        elif i==len(l)-1:
            print(chr(j+1))
            exit()
        elif chr(j) == 'z':
            print('None')
            exit()

Submission status: Wrong Answer

Solution code:
S=list(input())
l=sorted(list(set(S)))
for (i,j) in zip(range(len(l)),range(97,97+26)):
        if chr(j) !=l[i]:
            print(chr(j))
            exit()
        elif chr(j) == 'z':
            print('None')
            exit()
print('None')

Submission status: Wrong Answer

Solution code:
S=list(input())
l=sorted(list(set(S)))
for (i,j) in zip(range(len(l)),range(97,97+26)):
        if chr(j) !=l[i]:
            print(chr(j))
            break
        elif chr(j) == 'z':
            print('None')
            break

Submission status: Wrong Answer

Solution code:
S = input()
s = ord("a")

for i in range(27):
  if chr(s) in S:
    s=s+1
    continue
  else:
    print(chr(s))
    break
  print("None")

Submission status: Wrong Answer

Solution code:
S = input()
s = ord("a")

for i in range(27):
  if chr(s) in S:
    s=s+1
    continue
  else:
    print(chr(s))
    break

Submission status: Wrong Answer

Solution code:
s = sorted(set(input()))
if len(s)==26:
    print('None')
else:
    for i in range(25):
        if s.count(chr(ord('a')+i))==0:
            print(chr(ord('a')+i))
            break

Submission status: Wrong Answer

Solution code:
S = list(input())
S = sorted(list(set(S)))
i = 97
for s in S:
    if ord(s) != i:
        print(chr(i))
        exit()
    i += 1
print('None')

Submission status: Wrong Answer

Solution code:
import sys
S=input()
s=[]
for i in S:
    s.append(i)
x=[chr(i) for i in range(97,97+26)]
s.sort()
#print(s)
l=sorted(set(s),key=s.index)
#print(l)
for i in range(len(l)):
    if l[i]!=x[i]:
        print(x[i])
        sys.exit()
print("None")

Submission status: Wrong Answer

Solution code:
import sys
S=input()
s=[]
for i in S:
    s.append(i)
x=[chr(i) for i in range(97,97+26)]
s.sort()
for i in range(len(s)):
    if s[i]!=x[i]:
        print(x[i])
        sys.exit()
print("None")

Submission status: Wrong Answer

Solution code:
S = list(input())
s = sorted(list(set(S)))
l = ['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']

ans = 'None'

for i in range(24):
    if s[i] != l[i]:
        ans = l[i]
        break

print(ans)

Submission status: Wrong Answer

Solution code:
s=str(input())
s=list(s)
s=set(s)
s=list(s)
s.sort()
a="abcdefghijklmnopqrstuvwxyz"
a=list(a)
i=0
while i<len(s):
  if s[i]!=a[i]:
    print(a[i])
    break
  i=i+1
else:
  print("None")

Submission status: Wrong Answer

Solution code:
s=str(input())
s=list(s)
s=set(s)
s=list(s)
s.sort()
a="abcdefghijklmnopqrstuvwxyz"
a=list(a)
for i in range(0,25):
  if s[i]!=a[i]:
    print(a[i])
    break
else:
  print("None")

Submission status: Wrong Answer

Solution code:
n=input()
l=sorted(n)
li=list(set(l))
li.sort()
la=[chr(ord('a') + i) for i in range(26)]
ans=""
for i in range(len(li)):
    if li[i]!=la[i]:
        ans=la[i]
        break
    else:
        pass

if ans=="":
  print("None")
else:
  print(ans)

Submission status: Wrong Answer

Solution code:
n=input()
l=sorted(n)
li=list(set(l))
li.sort()
print(li)
la=[chr(ord('a') + i) for i in range(26)]
ans=""
for i in range(len(li)):
    if li[i]!=la[i]:
        ans=la[i]
        break
    else:
        pass

if ans=="":
  print("None")
else:
  print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'
for i in s:
  if i in alpha:
    alpha = alpha.strip(i)
if alpha == '':
  print('None')
else:
  print(alpha[0])

Submission status: Wrong Answer

Solution code:
def main():
    s = list(input())
    s = sorted(set(s))
    ans = 'None'
    if 'a' not in s:
        ans = 'a'
        print(ans)
        exit()
    if len(s) == 0:
        print(ans)
        exit()
    for i in range(len(s)-1):
        if s[i] == 'z':
            break
        if ord(s[i])+1 != ord(s[i+1]):
            ans = chr(ord(s[i])+1)
            break
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    s = list(input())
    s = sorted(set(s))
    ans = 'None'
    if 'a' not in s:
        ans = 'a'
        print(ans)
        exit()
    for i in range(len(s)-1):
        if s[i] == 'z':
            break
        if ord(s[i])+1 != ord(s[i+1]):
            ans = chr(ord(s[i])+1)
            break
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    s = list(input())
    s = sorted(set(s))
    ans = 'None'
    if 'a' not in s:
        ans = 'a'
        print(ans)
        exit()
    for i in range(len(s)-1):
        if ord(s[i])+1 != ord(s[i+1]):
            ans = chr(ord(s[i])+1)
            break
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    s = list(input())
    s = sorted(set(s))
    ans = 'None'
    for i in range(len(s)-1):
        if ord(s[i])+1 != ord(s[i+1]):
            ans = chr(ord(s[i])+1)
            break
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
s = input().strip()

d = {
    '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 c in s:
    d[c] += 1

for c in d.keys():
    if d[c] == 0:
        print(c)
        exit(0)

print('None')

Submission status: Wrong Answer

Solution code:
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    S =     _in[0]   # type:str
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    s_arr = [s for s in S]
    s_arr = list(set(s_arr))
    if len(s_arr) == 26:
        s = 'None'
    else:
        s_arr.sort()
        for s,alphabet in zip(s_arr,[chr(i) for i in range(97, 97+26)]):
            if s!=alphabet:
                s = alphabet
                break
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(s)

Submission status: Wrong Answer

Solution code:
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    S =     _in[0]   # type:str
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    s_arr = [s for s in S]
    s_arr = list(set(s_arr))
    if len(s_arr) == 26:
        s = None
    else:
        s_arr.sort()
        for s,alphabet in zip(s_arr,[chr(i) for i in range(97, 97+26)]):
            if s!=alphabet:
                s = alphabet
                break
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(s)

Submission status: Wrong Answer

Solution code:
s = input()
ans = sorted(set(s) ^ set('abcdefghijklmnopqrstuxxyz'))
print('None' if len(ans) == 0 else ans[0])

Submission status: Wrong Answer

Solution code:
s = input()
ans = sorted(set(s) ^ set('abcdefghijklmnopqrstuxxyz'))
print('None' if ans == '' else ans[0])

Submission status: Wrong Answer

Solution code:
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    S =     _in[0]   # type:str
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    s_arr = [s for s in S]
    s_arr = list(set(s_arr))
    if len(s_arr) == 26:
        s = None
    else:
        s_arr.sort()
        for s,alphabet in zip(s_arr,[chr(i) for i in range(97, 97+26)]):
            print(s,alphabet)
            if s!=alphabet:
                s = alphabet
                break
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(s)

Submission status: Wrong Answer

Solution code:
S = input()
List = []
for i in range(len(S)):
  tmp = S[i]
  List.append(tmp)
List = list(set(List))
num2alpha = lambda c: chr(c+64)
for k in range(1,27):
  if(num2alpha(k) in List):
    print(num2alpha(k))
    exit()
print("None")

Submission status: Wrong Answer

Solution code:
import string

s = input()

lall = [chr(i) for i in range(97, 97+26)]
#print(lall)

for x in lall:
    if x not in s:
        print(x)
        break
print("None")

Submission status: Wrong Answer

Solution code:
import string

s = input()

lall = [chr(i) for i in range(97, 97+26)]
#print(lall)

for x in lall:
    if x not in s:
        print(x)
        break

Submission status: Wrong Answer

Solution code:
import string

s = input()

lall = [chr(i) for i in range(97, 97+26)]
#print(lall)

c = 0
d = 0
for i in range(len(lall)):
    if c == 1:
        break
    elif d == 26:
        print("None")
        break
    elif lall[i] in s:
        d += 1
    else:
        print(lall[d])
        c += 1

#

Submission status: Wrong Answer

Solution code:
import string

s = input()

lall = [chr(i) for i in range(97, 97+26)]
#print(lall)

c = 0
d = 0
for i in range(len(lall)):
    if c == 1:
        break
    elif d == 25:
        print("None")
        break
    elif lall[i] in s:
        d += 1
    else:
        print(lall[d])
        c += 1

Submission status: Wrong Answer

Solution code:
S=input()
alphabet=[chr(i) for i in range(97, 97+26)]
ans='Yeah'
for a in alphabet:
  if a not in S:
    ans='Wow'
    break
print(a)
if ans!='Wow':
  print('None')

Submission status: Wrong Answer

Solution code:
S=input()
alphabet=[chr(i) for i in range(97, 97+26)]
ans='Yeah'
for a in alphabet:
  if a not in S:
    break
print(a)
ans='Wow'
if ans!='Wow':
  print('None')

Submission status: Wrong Answer

Solution code:
s=sorted(set(input()))
for i in range(len(s)):
    s[i]=ord(s[i])
s.append("*")
x=0
a=97
while s[x]==a:
    x+=1
    a+=1
print(chr(a) if a<122 else None)

Submission status: Wrong Answer

Solution code:
s=sorted(input())
for i in range(len(s)):
    s[i]=ord(s[i])
s.append("*")
x=0
a=97
while s[x]==a:
    x+=1
    a+=1
print(chr(a) if a<122 else None)

Submission status: Wrong Answer

Solution code:
lst=["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"]
moji = str(input())
ans = "z"
cnt = 0
for i in range(26):
  if lst[i] not in moji and lst[i] < ans:
    ans = lst[i]
    cnt += 1
if cnt > 0:
  print(ans)
elif cnt==0:
  print("None")

Submission status: Wrong Answer

Solution code:
lst=["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"]
moji = str(input())
ans = "z"
cnt = 0
for i in range(26):
  if lst[i] not in moji and lst[i] < ans:
    ans = lst[i]
    cnt += 1
if cnt > 0:
  print(ans)
else:
  print("None")

Submission status: Wrong Answer

Solution code:
import string

S = list(map(str, input()))
s = sorted(set(S))

alphabet = string.ascii_lowercase

if len(s)==1 and s[0] == a:
    print("b")

elif len(s) == len(alphabet):
    print("None")

else:
    for i in range(len(s)):
        if s[i] != alphabet[i]:
            print(alphabet[i])
            break

Submission status: Wrong Answer

Solution code:
import string

S = list(map(str, input()))
s = sorted(set(S))

alphabet = string.ascii_lowercase

if len(s) == len(alphabet):
    print("None")

else:
    for i in range(len(s)):
        if s[i] != alphabet[i]:
            print(alphabet[i])
            break

Submission status: Wrong Answer

Solution code:
S=input()
count={'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 i in range(len(S)):
    count[S[i]]+=1

ans=[]
for key, value in count.items():
    if value==0:
        ans.append(key)

if len(ans)==0:
    print('None')
else:
    print(ans[0])

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys

input = sys.stdin.readline

S = input()

S = sorted(list(set(S[:-1])))


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


s = 0
for t in S:
    if t == alpha[s] :
        s+=1
    else:
        print(alpha[s])
        exit()


print("None")

Submission status: Wrong Answer

Solution code:
import collections
s = list(input())
c = collections.Counter(s)
p = list(c.items())
p.sort()
i=0
for k,v in p:
    if k == chr(ord("a")+i):
        i += 1
    else:
        print(chr(ord("a")+i))
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
S = input()
Cnt = 0
result = [False]*26
for s in S:
	result[ord(s)-97] = True
for r in range(26):
	Cnt +=1
	if result[r]==False:
		break
if Cnt != 26:
	print(chr(Cnt+96))
else:
	print('None')

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(26):
  if not chr(ord('a')+i) in s:
    print(chr(ord('a')+i))
    break
else:
  print('NONE')

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(97,123):
  if not chr(i) in s:
    print(chr(i))
    break
else:
  print('NONE')

Submission status: Wrong Answer

Solution code:
s=input()
S=list(set(s))
A=[]
cnt=124
for i in range(97,123):
  A.append(S.count(chr(i)))
#print(A)
if sum(A)==26:
  print('NONE')
else:
  print(chr(A.index(0)+97))

Submission status: Wrong Answer

Solution code:
S = input()
flag = True
for i in range(24):
    if not chr(ord('a') + i) in S:
        print(chr(ord('a') + i))
        flag = False
        break
if flag:
    print('None')

Submission status: Wrong Answer

Solution code:
S = list(map(str, input()))
S = set(S)
a = set(list('abcdefghijklmnopqrstuvwxyz'))
if len(list(S-a)) == 0:
  print('None')
else:
  print(sorted(list(S-a))[0])

Submission status: Wrong Answer

Solution code:
Sold = list(map(str, input()))
Snew = set(Sold)
alph = set(list('abcdefghijklmnopqrstuvwxyz'))
if len(list(Snew-alph))==0:
  print('None')
else:
  print(sorted(list(Snew-alph))[0])

Submission status: Wrong Answer

Solution code:
Sold = list(map(str, input()))
Snew = set(Sold)
alph = set(list('abcdefghijklmnopqrstuvwxyz'))
if len(list(Snew-alph))==0:
  print('none')
else:
  print(sorted(list(Snew-alph))[0])

Submission status: Wrong Answer

Solution code:
S=str(input())
list_ = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(S)):
  if len([1 for s in list_ if s==S[i]])>0:
    n=list_.index(S[i])
    list_ = list_[:n] + list_[n + 1:]
if len(list_)>1:
  print(list_[0])
else:
  print("None")

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
import string

alf = string.ascii_lowercase

d = defaultdict(int)
S = ''.join(sorted(input()))
for v in alf:
    d[v] = 0

for i, v in enumerate(S):
    d[v] += 1
# print(sorted(d.items()))

sd = sorted(d.items())

if (len(sd) == 26):
    print('None')
for v in sd:
    if(v[1] == 0):
        print(v[0])
        exit()

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
import string
alf = string.ascii_lowercase

d = defaultdict(int)
S = ''.join(sorted(input()))

if (alf in S):
    print('None')
    exit()

for v in alf:
    d[v] = 0

for i, v in enumerate(S):
    d[v] += 1

# print(sorted(d.items()))

sd = sorted(d.items())
for v in sd:
    if(v[1] == 0):
        print(v[0])
        exit()

Submission status: Wrong Answer

Solution code:
s = list(input())
set(s)
s.sort()
t = list("abcdefghijklmnopqrstuvwxyz")

for c in t:
  if c in s:
    continue
  else:
    print(c)
    exit()

Submission status: Wrong Answer

Solution code:
S = input()
for i in range(ord("a"), ord("z")+1):
  if chr(i) not in S:
    print(chr(i))
    exit()

Submission status: Wrong Answer

Solution code:
l=sorted(set(ord(c) for c in input()))
ans=[i for x, y in zip(l, l[1:]) for i in range(x + 1, y) if y - x > 1]
if len(ans)>0:
    print (chr(ans[0]))
else:
    print ('None')

Submission status: Wrong Answer

Solution code:
s = list(sorted(input()))

ans = 'None'
for i in range(26):
    if chr(97 + i) not in s:
        ans = chr(97 + i)
        print(ans)
        break
print(ans)

Submission status: Wrong Answer

Solution code:
s=list(input())
lowercase = 'abcdefghijklmnopqrstuvwxyz'
count=0
for moji in lowercase:
  count+=1
  if count==len(s):
    print('None')
    break
  if moji not in s:
    print(moji)
    break

Submission status: Wrong Answer

Solution code:
S = input()
S = set([s for s in S])

if len(S) == 26:
    print('None')
else:
    for i in range(97, 122):
        if chr(i) not in S:
            print(chr(i))
            break

Submission status: Wrong Answer

Solution code:
s = input()
l = sorted(list({s[i] for i in range(len(s))}))
ans = ("a" if l[0] != "a" else "b")
if len(l) == 26:
    ans = "None"
elif l[0] != "a":
    ans = "a"
else:
    for i in range(len(l) - 1):
        if ord(l[i]) + 1 != ord(l[i + 1]):
            ans = chr(ord(l[i]) + 1)
            break
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
l = sorted(list({s[i] for i in range(len(s))}))
ans = ("a" if l[0] != "a" else "b")
if len(l) == 26:
    ans = "None"
else:
    for i in range(len(l) - 1):
        if ord(l[i]) + 1 != ord(l[i + 1]):
            ans = chr(ord(l[i]) + 1)
            break
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
l = sorted(list({s[i] for i in range(len(s))}))
ans = chr(ord(l[0]) + 1)
if len(l) == 26:
    ans = "None"
else:
    for i in range(len(l) - 1):
        if ord(l[i]) + 1 != ord(l[i + 1]):
            ans = chr(ord(l[i]) + 1)
            break
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
l = sorted(list({s[i] for i in range(len(s))}))
ans = l[0]
if len(l) == 26:
    ans = "None"
else:
    for i in range(len(l) - 1):
        if ord(l[i]) + 1 != ord(l[i + 1]):
            ans = chr(ord(l[i]) + 1)
            break
print(ans)

Submission status: Wrong Answer

Solution code:
import itertools
import math
import string
import collections
from collections import Counter
from collections import deque
import sys
sys.setrecursionlimit(2*10**5)
INF = 2**60


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

S = input()
# print(S)
SS = list(S)
a = []
for i in range(97, 97+26):
    a.append(chr(i))

result = list(set(a)-set(SS))
if result == []:
    print('None')
else:
    print(result[0])

Submission status: Wrong Answer

Solution code:
eng=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','x','y','z']

sentence=input()
sentence= sentence.lower()

for i in eng:
  if not i in sorted(list(set(sorted(sentence)))):
    print(i)
    break
  else:
    print('None')

Submission status: Wrong Answer

Solution code:
eng=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','x','y','z']

sentence=input()
sentence= sentence.lower()

for i in eng:
  if not i in sorted(list(set(sorted(sentence)))):
    print(i)
    break

Submission status: Wrong Answer

Solution code:
s=sorted(set(input()))
ro='abcdefghijklmnopqrstuvwxyz'
if len(s)==len(ro):
    print('None')
else:
    for i in range(len(s)):
        if s[i]!=ro[i]:
            print(ro[i])
            break
        if s[-1]!=ro[len(ro)-1]:
            print(ro[len(s)])
            break

Submission status: Wrong Answer

Solution code:
s=sorted(set(input()))
ro='abcdefghijklmnopqrstuvwxyz'
if len(s)==len(ro):
    print('None')
else:
    for i in range(len(s)):
        if s[i]!=ro[i]:
            print(ro[i])
            break
        if s[-1]!=ro[len(ro)-1]:
            print('z')
            break

Submission status: Wrong Answer

Solution code:
s=sorted(set(input()))
ro='abcdefghijklmnopqrstuvwxyz'
if len(s)==len(ro):
    print('None')
else:
    for i in range(len(s)):
        if s[i]!=ro[i]:
            print(ro[i])
            break
        if s[-1]!=ro[len(ro)-1]:
            print(s[-1])
            break

Submission status: Wrong Answer

Solution code:
s=sorted(set(input()))
ro='abcdefghijklmnopqrstuvwxyz'
if len(s)==len(ro):
    print('None')
else:
    for i in range(len(s)):
        if s[i]!=ro[i]:
            print(ro[i])
            break
        if s[-1]!=ro[-1] and len(s)!=len(ro):
            print(s[-1])
            break

Submission status: Wrong Answer

Solution code:
s=sorted(set(input()))
ro='abcdefghijklmnopqrstuvwxyz'
if len(s)==len(ro):
    print('None')
else:
    for i in range(len(s)):
        if s[i]!=ro[i]:
            print(ro[i])
            break
        if s[len(s)-1]=='y':
            print('z')
            break

Submission status: Wrong Answer

Solution code:
s=sorted(set(input()))
ro='abcdefghijklmnopqrstuvwxyz'
if len(s)==len(ro):
    print('None')
else:
    for i in range(len(s)):
        if s[i]!=ro[i]:
            print(ro[i])
            break

Submission status: Wrong Answer

Solution code:
s = input()
Al = [chr(_)  for _ in range(97,124)]
      
for i in range(len(s)):
  if s[i] in Al:
    Al.remove(s[i])

if len(Al) ==0:
    print('None')
else :
    print(Al[0])

Submission status: Wrong Answer

Solution code:
S = input()
L = "abcdefghijklmnopqrstuvwxyz"
for i in L:
  if i in S:
    print(i)
    exit()
print("None")

Submission status: Wrong Answer

Solution code:
import string

s = set(input())

a = set(string.ascii_lowercase)
b = list(a - s)
ans = b[0] if len(b) else "None"
print(ans)

Submission status: Wrong Answer

Solution code:
import string
s = list(set(list(input())))
s.sort()
ans = 'None'
for i, j in zip(s, string.ascii_lowercase):
    if i != j:
        ans = j
        break
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
s = list(set(input()))
s.sort()
alp = list('abcdefghijklmnopqrstuvwxyz')

for s_,alp_ in zip(s,alp):
    if s_ != alp_ :
        print(alp_)
        sys.exit()

print('None')

Submission status: Wrong Answer

Solution code:
import sys
s = list(input())
s.sort()
alp = list('abcdefghijklmnopqrstuvwxyz')

for s_,alp_ in zip(s,alp):
    if s_ != alp_ :
        print(alp_)
        sys.exit()

print('None')

Submission status: Wrong Answer

Solution code:
s = list(input())
s.sort()
alp = list('abcdefghijklmnopqrstuvwxyz')

for s_,alp_ in zip(s,alp):
    if s_ != alp_ :
        print(alp_)
        exit()

print('None')

Submission status: Wrong Answer

Solution code:
alphabet = [chr(ord('a') + i) for i in range(26)]
s = list(input())
s = sorted(list(set(s)))
if len(s) == 26:
    print("None")
    exit()
for i in range(len(s)):
    if i == len(s) - 1:
        print(alphabet[i + 1])
        exit()
    elif s[i] == alphabet[i]:
        pass
    else:
        print(alphabet[i])
        exit()

Submission status: Wrong Answer

Solution code:
alphabet = [chr(ord('a') + i) for i in range(26)]
s = list(input())
s = list(set(s))
s.sort()
for i in range(len(s)):
    if i == len(s) - 1 and i != 25:
        print(alphabet[i + 1])
        exit()
    if s[i] == alphabet[i]:
        pass
    else:
        print(alphabet[i])
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
alphabet = [chr(ord('a') + i) for i in range(26)]
s = list(input())
s = list(set(s))
s.sort()
for i in range(len(s)):
    if s[i] == alphabet[i] and i != len(s) - 1:
        pass
    else:
        print(alphabet[i])
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
alphabet = [chr(ord('a') + i) for i in range(26)]
s = list(input())
s = list(set(s))
s.sort()
for i in range(len(s)):
    if s[i] == alphabet[i]:
        pass
    else:
        print(alphabet[i])
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
s=input()
al = list('abcdefghijelmnopqrstuvwxyz')
for s0 in s:
    if s0 in al:
        al.remove(s0)
if len(al) == 0:
    print(None)
else:
    print(al[0])

Submission status: Wrong Answer

Solution code:
s = str(input())
S = [s[i] for i in range(len(s))]
S.sort()
S = set(S)
count = [chr(i) for i in range(97, 97+26)]
for i in count:
    if i in S:
        pass
    else:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
import string
t = list(string.ascii_lowercase)
s = input()

def find(s):
    for i in range(len(t)):
        if s.count(t[i]) == 0:
            return t[i]
    return 'None'

find(s)

Submission status: Wrong Answer

Solution code:
s = sorted(input())
t=[]

for i in range(len(s)):
  t.append(ord(s[i]))
x=97


for i in set(t):
  if i!=x:
    print(chr(x))
    exit()
  x+=1
print("None")

Submission status: Wrong Answer

Solution code:
S = list(set(list(input())))
S.sort(reverse=False)
n = 97

for i in range(len(S)):
  if S[i] != chr(n):
    print(chr(n))
    exit()
  n += 1

print('None')

Submission status: Wrong Answer

Solution code:
a = input()
a_l = 'abcdefghijklmnopqrstuvwxyz'
for i in range(26):
  if a.count(a_l[i])>=1:
    continue
  else:
    print(a_l[i])
    break

Submission status: Wrong Answer

Solution code:
def check(S):
  for i in range(97, 123):
    if chr(i) not in S:
      return chr(i)
  return 'None'


if __name__ == "__main__":
  S = set(input())
  print(S)
  print(check(S))

Submission status: Wrong Answer

Solution code:
s = input().strip()
chars = list(set(s))
chars.sort()
dic = {"a": 0,
       "b": 1,
       "c": 2,
       "d": 3,
       "e": 4,
       "f": 5,
       "g": 6,
       "h": 7,
       "i": 8,
       "j": 9,
       "k": 10,
       "l": 11,
       "m": 12,
       "n": 13,
       "o": 14,
       "p": 15,
       "q": 16,
       "r": 17,
       "s": 18,
       "t": 19,
       "u": 20,
       "v": 21,
       "w": 22,
       "x": 23,
       "y": 24,
       "z": 25
       }
swap = {v: k for k, v in dic.items()}
ans = "None"
count = 0
for c in chars:
    if dic[c] != count:
        ans = swap[count]
        break
    count += 1
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
words = ['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']
for i in range(len(words)):
    if words[i] not in s:
        print(words[i])
        break

Submission status: Wrong Answer

Solution code:
alpha="abcdefghijklmnopqrstuvwxyz"
s=input()
s1=set(s)
s2=sorted(list(s1))
if len(s1)==1:
    print('b')
    exit()

for i in range(len(alpha)):

    if i==len(s2):
        print(chr(ord(s[i-1])+1))
        exit()

    if s2[i]!=alpha[i]:
        print(alpha[i])
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
alpha="abcdefghijklmnopqrstuvwxyz"
s=input()
s1=set(s)
s2=sorted(list(s1))
for i in range(len(alpha)):

    if i==len(s2):
        print(chr(ord(s[i-1])+1))
        exit()

    if s2[i]!=alpha[i]:
        print(alpha[i])
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
alpha="abcdefghijklmnopqrstuvwxyz"
s=input()
s1=set(s)
s2=sorted(list(s1))
for i in range(len(alpha)):
    if i==len(s2):
        print(chr(ord(s[i-1])+1))
        exit()

    if s2[i]!=alpha[i]:
        print(alpha[i])
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
alpha="abcdefghijklmnopqrstuvwxyz"
s=input()
s1=set(s)
s2=sorted(list(s1))
for i in range(len(alpha)):
    if i==len(s2):
        if s2[i-1]=='a':
            print('b')
        else:
            print('a')
        exit()
    if s2[i]!=alpha[i]:
        print(alpha[i])
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
alpha="abcdefghijklmnopqrstuvwxyz"
s=input()
s1=set(s)
s2=sorted(list(s1))
for i in range(len(alpha)):
    if i==len(s2):
        break
    if s2[i]!=alpha[i]:
        print(alpha[i])
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
str = input()
list = list(str)
abc = ['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']
i = 0
while abc[i] in str:
    if i < 25:
        i += 1
    else:
        break

if i < 26:
    print(abc[i])
else:
    print("None")

Submission status: Wrong Answer

Solution code:
str = input()
list = list(str)
abc = ['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']
i = 0
while abc[i] in str:
    if i < 25:
        i += 1
    else:
        break

if i < 26:
    print(abc[i])
else:
    print("None")
    print(i)

Submission status: Wrong Answer

Solution code:
str = input()
list = list(str)
abc = ['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']
i = 0
while abc[i] in str:
    if i < 25:
        i += 1
    else:
        break

if i > 26:
    print(abc[i])
else:
    print("None")

Submission status: Wrong Answer

Solution code:
s = list(input())
# s.sort()
ans = 'None'
t = []
for i in range(len(s)):
  t.append(ord(s[i]))
for i in range(97, 122):
  if not i in t:
    ans = chr(i)
    break
print(ans)