Python program to check if given string is pangram

# Input string
s = "The quick brown fox jumps over the lazy dog"
# Initialize bitmask for tracking found letters
f = 0
# Loop through each character in lowercase string
for char in s.lower():
    if char.isalpha():  # Check if the character is alphabetic
        f |= 1 << (ord(char) - ord('a'))  # Set corresponding bit for letter
    
    if f == (1 << 26) - 1:  # All letters found
        print(True)  # It's a pangram
        break
else:
    print(False)  # Not a pangram

import string
# Input string
a = "The quick brown fox jumps over the lazy dog"
# Create set of all lowercase English letters
b = set(string.ascii_lowercase)
# Convert input text to lowercase 
# Create a set of characters
s = set(a.lower())
# Check if `s` contains all letters of `b`
res = b <= s
print(res)

import string
# Input text
s = "Python is great"
# Check if all letters are in `s`
res = all(letter in s.lower() for letter in string.ascii_lowercase)
print(res)

import string
# Input text
s = "The quick brown fox jumps over the lazy dog."
# Check if each letter of the alphabet appears in `t`
for letter in string.ascii_lowercase:
    if s.lower().count(letter) == 0:
        print(False)
        break
else:
    print(True)