1832. Check if the Sentence Is Pangram Easy

@problem@discussion
#Hash Table#String



1/**
2 * [1832] Check if the Sentence Is Pangram
3 *
4 * A pangram is a sentence where every letter of the English alphabet appears at least once.
5 * Given a string sentence containing only lowercase English letters, return true if sentence is a pangram, or false otherwise.
6 *  
7 * Example 1:
8 * 
9 * Input: sentence = "thequickbrownfoxjumpsoverthelazydog"
10 * Output: true
11 * Explanation: sentence contains at least one of every letter of the English alphabet.
12 * 
13 * Example 2:
14 * 
15 * Input: sentence = "leetcode"
16 * Output: false
17 * 
18 *  
19 * Constraints:
20 * 
21 * 	1 <= sentence.length <= 1000
22 * 	sentence consists of lowercase English letters.
23 * 
24 */
25pub struct Solution {}
26
27// problem: https://leetcode.com/problems/check-if-the-sentence-is-pangram/
28// discuss: https://leetcode.com/problems/check-if-the-sentence-is-pangram/discuss/?currentPage=1&orderBy=most_votes&query=
29
30// submission codes start here
31
32impl Solution {
33    pub fn check_if_pangram(sentence: String) -> bool {
34        false
35    }
36}
37
38// submission codes end
39
40#[cfg(test)]
41mod tests {
42    use super::*;
43
44    #[test]
45    fn test_1832() {
46    }
47}
48


Back
© 2025 bowen.ge All Rights Reserved.