Pangram check
A pangram uses every letter of the English alphabet at least once. Ignoring case and non-letters, print YES if the line is a pangram, otherwise NO.
Reported in: TCS NQT (memory-based)
Input
One line of text.
Output
YES or NO.
Constraints
1 ≤ length ≤ 10^5.
Example 1
Input:
The quick brown fox jumps over the lazy dog
Output:
YESExample 2
Input:
Hello world
Output:
NOHint: Collect the lower-case letters in a set and check its size is 26.