Python program to check if given string is pangram

The task is to check if a string is a pangram which means it includes every letter of the English alphabet at least once. In this article, we’ll look at different ways to check if the string contains all 26 letters.

Using Bitmasking

Bitmasking uses a number where each bit represents a letter in the alphabet. It updates the bits as it finds letters in the string and checks if all 26 letters are present.

Example:

True

Using sets

We can use sets to store unique characters and perform fast checks. string.ascii_lowercase gives a string of all lowercase letters, which can be turned into a set for easy comparison.

Example:

True

Using all()

all() function checks if every condition in a list is true. Here, it checks if every letter of the alphabet is in the given text and returns True only if all letters are found.

Example:

False

Using count()

count() method checks how many times each letter appears in the string. It repeatedly does this for all letters of the alphabet to see if the string contains every letter.

Example:

True

Explanation:

• string.ascii_lowercase provides all lowercase letters to check against the input string.
• s.lower().count(letter) This checks if each letter appears in `s`, prints False if any letter is missing.