Use Every Letter
InterviewTime limit2sMemory limit256 MB
Decide for each of up to 50 sentences whether it contains every letter a to z, and list the missing letters otherwise.
Problem
A pangram is a sentence that uses all 26 letters a to z at least once each. The best known example is "The quick brown fox jumps over the lazy dog."
Kkung wants to know whether any other sentence is a pangram. Read several sentences and decide for each one whether it is a pangram.
Letter case does not matter when you check for a pangram.
Input
The first line contains the number of sentences . ()
Each of the next lines contains one sentence. A sentence may contain uppercase and lowercase letters, spaces, digits, and the punctuation marks . , ? ! ' ".
Each sentence is between 1 and 100 characters long.
Output
Print one line for each sentence.
If the sentence is a pangram, print pangram.
Otherwise print missing, then a single space, then every letter that does not appear in the sentence. Print those letters in lowercase, sorted alphabetically, with no spaces between them.