carloscn
commented
1 year ago Analysis
pub fn check_if_pangram(sentence: &str) -> bool
{
if sentence.len() < 26 {
return false;
}
let mut s:Vec<char> = sentence.chars()
.filter(|x| x.is_alphabetic())
.collect();
if s.len() < 26 {
return false;
}
s.dedup();
if s.len() < 26 {
return false;
}
return true;
}
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.