1832. Check if the Sentence Is Pangram

Problem Link

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, 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.

Solution

---

Python3

class Solution:
    def checkIfPangram(self, sentence: str) -> bool:
        res = 0
        
        for x in sentence:
            k = ord(x) - ord("a")
            
            if res & (1 << k) == 0:
                res ^= (1 << k)
        
        return res == (1 << 26) - 1