set with issubset

Pangram
Pangram in Python 
from string import ascii_lowercase

ALPHABET = set(ascii_lowercase)


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

In this approach a set is made from the ascii_lowercase letters, and another set is made from the lowercased letters in the sentence.

The function returns if the alphabet set issubset() of the sentence set. If all of the letters in the alphabet are a subset of the letters in the sentence, 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. 

def is_pangram(sentence):
    return len([ltr for ltr in set(sentence.lower()) if ltr.isalpha()]) \
        == 26
set with len

Use set with len. 

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.