We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Check if the Sentence Is Pangram

Difficulty: Easy

Problem 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.

Key Insights

  • A pangram requires all 26 letters of the English alphabet.
  • We can utilize a set data structure to track the unique letters present in the sentence.
  • The length of the set at the end should equal 26 for the sentence to be a pangram.

Space and Time Complexity

Time Complexity: O(n), where n is the length of the sentence.
Space Complexity: O(1), as the maximum size of the set is limited to 26 characters (the letters of the alphabet).

Solution

To determine if a sentence is a pangram, we can iterate through each character in the sentence and add it to a set. Sets automatically handle duplicates, so we only store unique characters. After processing the sentence, we simply check if the size of the set is 26, which would indicate that all letters of the alphabet are present.

Code Solutions

def checkPangram(sentence: str) -> bool:
    # Create a set to store unique letters
    unique_letters = set()
    
    # Iterate through each character in the sentence
    for char in sentence:
        unique_letters.add(char)  # Add the character to the set
    
    # Check if the set contains all 26 letters
    return len(unique_letters) == 26
← Back to All Questions