Complete String
Practice
3.8 (104 votes)
Ad Hoc
Approved
Basic programming
Easy
Open
Problem
58% Success 21406 Attempts 20 Points 3s Time Limit 256MB Memory 1024 KB Max Code

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

Please login to use the editor

You need to be logged in to access the code editor

Loading...

Please wait while we load the editor

Loading...
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Similar Problems
Points:20
13 votes
Tags:
AlgorithmsApprovedBrute-force searchData StructuresEasyImplementationOpen
Points:20
29 votes
Tags:
ApprovedBasic ProgrammingEasyOpen
Points:20
71 votes
Tags:
Ad-HocApprovedEasyImplementationOpenReadySorting