all with contains on lower case

Pangramma
Pangramma in Rust 
pub fn is_pangram(sentence: &str) -> bool {
    let sentence_lowered = sentence.to_lowercase();
    ('a'..='z').all(|ltr| sentence_lowered.contains(ltr))
}
  • This begins by lowercasing the input by using to_lowercase.
  • It then checks if all letters in the alphabet are contained in the sentence, using the Iterator method all with the str method contains. If all of the letters in the alphabet are contained in the sentence, then the function will return true.
07 ottobre 2026 · L'hai trovato utile?

Altri approcci a Pangramma in Rust

Altri modi in cui la nostra community ha risolto questo esercizio
use std::collections::HashSet;

pub fn is_pangram(sentence: &str) -> bool {
    let all: HashSet<char> = HashSet::from_iter("abcdefghijklmnopqrstuvwxyz".chars());
    let used: HashSet<char> = HashSet::from_iter(sentence.to_lowercase().chars());
    all.is_subset(&used)
}
HashSet with is_subset

Use HashSet with is_subset. 

sentence
    .to_lowercase()
    .chars()
    .filter(|c| c.is_ascii_alphabetic())
    .collect::<HashSet<char>>()
    .len()
    == 26
HashSet with len

Use HashSet with len. 

for letter in sentence.chars() {
    if letter >= 'a' && letter <= 'z' {
        letter_flags |= 1 << (letter as u8 - A_LCASE);
    } else if letter >= 'A' && letter <= 'Z' {
        letter_flags |= 1 << (letter as u8 - A_UCASE);
    }
}
letter_flags == ALL_26_BITS_SET
Bit field

Use a bit field to keep track of used letters.