Alphabet Completeness Checker

You are given a list of strings. For each string, determine if it contains all 26 letters of the English alphabet at least once. The check is case-insensitive meaning that both uppercase and lowercase letters are considered equivalent. A string is deemed complete if it includes every letter from a to z regardless of the order or frequency.

Note: Non-alphabetical characters may be present in the string but should be ignored when determining completeness.

inputFormat

The input begins with a single integer n (n ≥ 1) on the first line, which is the number of strings to check. The following n lines each contain one string. The strings may be empty.

outputFormat

For each string, output a single line with either YES if the string contains all 26 letters of the English alphabet, or NO otherwise.

3
thequickbrownfoxjumpsoverthelazydog
hello
abcdefghijklmnopqrstuvwxyz

YES
NO
YES