Skip to content
Leetcode
Esc
↑↓navigate↵open⌘Jpreview
On this page

1832. Check if the Sentence Is Pangram

A pangram is a sentence where every letter of the English alphabet appears at least once

Hash Table

Example 1:

  • Input: sentence = "thequickbrownfoxjumpsoverthelazydog"
  • Output: true
  • Explanation: sentence contains at least one of every letter of the English alphabet.

Example 2:

  • Input: sentence = "leetcode"
  • Output: false

Constraints:

  • 1 <= sentence.length <= 1000
  • sentence consists of lowercase English letters.

Approach

Solution

/**
 * @param {string} sentence
 * @return {boolean}
 */
var checkIfPangram = function(sentence) {
    const freq = {};
    for (let c of sentence) freq[c] = (freq[c] || 0) + 1;
    
    if (Object.keys(freq).length === 26){
        return true;
    }
    return false;
};

Last updated on September 24, 2026

Was this page helpful?