1832

1832. Check if the Sentence Is Pangram (Easy)

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.

Related Topics:
String

Solution 1.

// OJ: https://leetcode.com/problems/check-if-the-sentence-is-pangram/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(C) where C is the length of the character set
class Solution {
public:
    bool checkIfPangram(string s) {
        unordered_set<char> ss(begin(s), end(s));
        return ss.size() == 26;
    }
};