Hide
Problem G
Alphabet Soup
Andrew is making himself a nice warm bowl of alphabet soup. However, before Andrew can eat the soup, he needs to make sure that it contains every letter of the alphabet. Can you write an algorithm that will tell him if his soup has all of the letters in it, and if not, which letters are missing?
Input
Input is a single line of uppercase letters (A-Z) of length $L$ ($0 <= L <= 1\, 000\, 000$), possibly containing duplicates.
Output
If all letters A-Z are present in the input, the output should be “Alphabet Soup!”. Otherwise, the output should be a single line containing all of the uppercase letters that were missing from the input string, in alphabetical order.
| Sample Input 1 | Sample Output 1 |
|---|---|
AQUICKBROWNFOXJUMPSOVERTHELAZYDOG |
Alphabet Soup! |
| Sample Input 2 | Sample Output 2 |
|---|---|
QWBGHMJKLXYCDRSZTVNPF |
AEIOU |
