forked from OmkarPathak/Python-Programs
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathP08_CompleteString.py
More file actions
33 lines (31 loc) · 786 Bytes
/
Copy pathP08_CompleteString.py
File metadata and controls
33 lines (31 loc) · 786 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
# A string is said to be complete if it contains all the characters from a to z. Given a string, check if it complete or
# not.
#
# Input
# First line of the input contains the number of strings N. It is followed by N lines each contains a single string.
#
# Output
# For each test case print "YES" if the string is complete, else print "NO"
#
# Constraints
# 1 <= N <= 10
# The length of the string is at max 100 and the string contains only the characters a to z
# SAMPLE INPUT
# 3
# wyyga
# qwertyuioplkjhgfdsazxcvbnm
# ejuxggfsts
#
# SAMPLE OUTPUT
# NO
# YES
# NO
testCases = int(input())
while testCases:
testCases -= 1
string = input()
alphabet = list(map(chr, range(97, 123)))
if set(alphabet) == set(string):
print('YES')
else:
print('NO')