leetcode/apps/docs/content/(01-linear-structures)/hash-table/1832-check-if-the-sentence-is-pangram.mdx

---
title: '1832. Check if the Sentence Is Pangram'
description: A pangram is a sentence where every letter of the English alphabet appears at least once
icon: line-dot-left-horizontal
sidebar:
  label: 'Check if the Sentence Is Pangram'
  badge: 'Easy'
---

<Badge variant="accent">Hash Table</Badge>

### 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

```mermaid
flowchart TD
  S(["checkIfPangram(sentence)"]) --> I["freq = {}"]
  I --> L{"more char c?"}
  L -- yes --> C["freq[c] = (freq[c] or 0) + 1"]
  C --> L
  L -- no --> Q{"distinct keys in freq == 26?"}
  Q -- yes --> R(["return true"])
  Q -- no --> F(["return false"])
```

## Solution

```js
/**
 * @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;
};
```