Description
A pangram is a sentence where every letter of the English alphabet appears at least once. Given a string sentence containing only lowercase English letters, return true if sentence is a pangram.
Examples
Input:
sentence = "thequickbrownfoxjumpsoverthelazydog"Output:
trueExplanation:
Contains all letters.
Input:
sentence = "leetcode"Output:
falseExplanation:
"leetcode" has only 8 unique letters, missing several letters of the alphabet. A pangram requires all 26.
Input:
sentence = "abcdefghijklmnopqrstuvwxyz"Output:
trueExplanation:
This sentence contains exactly all 26 letters of the alphabet in order, making it a pangram.
Constraints
- •
1 ≤ sentence.length ≤ 1000