LeetCode-in-Java
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 <= 1000sentenceconsists of lowercase English letters.
Solution
import java.util.HashSet;
import java.util.Set;
public class Solution {
public boolean checkIfPangram(String sentence) {
Set<Character> alphabet = new HashSet<>();
for (char c : sentence.toCharArray()) {
alphabet.add(c);
}
return alphabet.size() == 26;
}
}