Given a string from STDIN, determine if it's a pangram, not a pangram, or multiple pangrams where a multiple panagram must have exactly N instances of each character in the alphabet.
Upper case, lower case characters are same. (Case insensitive)
Skip other characters (commas, white spaces, etc)
e.g. Mr. Jock, TV quiz PhD, bags few lynx.
is a pangram.
This was asked in HackerRank Coding Round 1 for Software Engineer Position @ Eat Street.
Could you please provide more examples? Do you need to consider characters like comma or semicolon? How about upper and lowercase letters?
I forgot to add this. Upper case, lower case characters are considered same. (Case insensitive ). We only need to consider A-Z or a-z, skip everything else.
e.g. The quick brown fox jumps over the lazy dog
Lots of examples here