# LeetCode 1832. Check if the Sentence Is Pangram

## Description

https://leetcode.com/problems/check-if-the-sentence-is-pangram/

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, or `false` otherwise.

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.

## Explanation

Check if all the English letter occurs at least once in sentence.

## Python Solution

``````class Solution:
def checkIfPangram(self, sentence: str) -> bool:
counter = {}

for i in range(26):
counter[chr(ord('a') + i)] = 0

for c in sentence:
counter[c] = counter.get(c, 0) + 1

for key, value in counter.items():
if value < 1:
return False

return True``````
• Time Complexity: O(N).
• Space Complexity: O(N).