1832. Check if the Sentence Is Pangram

Problem

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 (Java)

class Solution {
    public boolean checkIfPangram(String sentence) {
        Set<Character> alphabet = new HashSet<>();
        for (char c : sentence.toCharArray()) {
            alphabet.add(c);
        }
        return alphabet.size() == 26;
    }
}

Explain:

nope.

Complexity:

• Time complexity : O(n).
• Space complexity : O(n).