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
Submissions
Please login to view your submissions
Similar Problems
Points:20
61 votes
Tags:
Ad-HocAlgorithmsApprovedBasic ProgrammingEasyOpen
Points:20
31 votes
Tags:
Ad-HocBrute-force searchEasyImplementation
Points:20
18 votes
Tags:
ApprovedEasyImplementationMathOpen
Editorial