Determine whether a sentence contains every letter of the English alphabet at least once.
Given a sentence consisting of lowercase English letters and spaces, determine whether it is a pangram.
A pangram is a sentence that contains every letter from a to z at least once.
Return true if the sentence is a pangram, otherwise return false.
sentence.true if sentence is a pangramfalse otherwise1 <= sentence.length <= 1000 in the typical LeetCode version.sentence contains only lowercase English letters and spaces.Example 1
Input
sentence = "thequickbrownfoxjumpsoverthelazydog"
Output
true
Explanation
This sentence contains every letter from a to z at least once.
Example 2
Input
sentence = "leetcode"
Output
false
Explanation
Several letters of the alphabet do not appear in the sentence.
Premium problem context
Premium adds guided hints, editorial links, similar variants, discussion resources, and concept maps so you can understand why a problem matters, not just solve it once.