set with len

Pangram
Pangram in Python 
def is_pangram(sentence):
    return len([ltr for ltr in set(sentence.lower()) if ltr.isalpha()]) \
        == 26
  • This approach first makes a set from the lowercased characters of the sentence.
  • The characters in the setare then iterated in a list comprehension.
  • The characters are filtered by an if isalpha() statement, so that only alphabetic characters make it into the list.
  • The function returns whether the len() of the list is 26. If the number of unique letters in the set is equal to the 26 letters in the alphabet, then the function will return True.
8th May 2024 · Found it useful?

Other Approaches to Pangram in Python

Other ways our community solved this exercise
from string import ascii_lowercase


def is_pangram(sentence):
    return all(letter in sentence.lower() for letter in ascii_lowercase)
all on lower case

Use all on lowercased letters. 

from string import ascii_lowercase

ALPHABET = set(ascii_lowercase)


def is_pangram(sentence):
    return ALPHABET.issubset(sentence.lower())
set with issubset

Use set with issubset. 

def is_pangram(sentence):
    letter_flags = 0
    for letter in sentence:
        if letter >= 'a' and letter <= 'z':
            letter_flags |= 1 << ord(letter) - A_LCASE
        elif letter >= 'A' and letter <= 'Z':
            letter_flags |= 1 << ord(letter) - A_UCASE
    return letter_flags == ALL_26_BITS_SET
Bit field

Use a bit field to keep track of used letters.