Alphabet Permutation Check

Given a string s consisting of lowercase English letters, determine whether s contains every letter of the English alphabet at least once. In other words, check if s has a permutation of the alphabet.

For example, the string "thequickbrownfoxjumpsoverthelazydog" contains all 26 letters, so the answer is YES. Otherwise, the answer should be NO.

Note: The number of letters in the alphabet is \(26\). Use this constant where appropriate.

inputFormat

The input is read from stdin and has the following format:

• The first line contains an integer \(T\), the number of test cases.
• Each of the following \(T\) lines contains a single string s, which consists only of lowercase English letters.

outputFormat

For each test case, print a single line to stdout containing YES if the string has every letter of the English alphabet (i.e. it contains a permutation of the alphabet), and NO otherwise.

3
abcdefghijklmnopqrstuvwxyza
hellopythonworld
thequickbrownfoxjumpsoverthelazydog

YES
NO
YES