#K33992. Pangram Checker
Pangram Checker
Pangram Checker
Given a sentence, determine whether it is a pangram. A pangram is a sentence that contains every single letter of the English alphabet at least once. In other words, the sentence must include all the letters from \(a\) to \(z\) (case-insensitively). For example, "The quick brown fox jumps over the lazy dog" is a pangram, while "Hello World" is not.
Your task is to read a sentence from the standard input and output True
if the sentence is a pangram, and False
otherwise.
inputFormat
The input consists of a single line containing a sentence. The sentence may include uppercase and lowercase letters, spaces, punctuation, and digits.
outputFormat
Output either True
or False
(without quotes) to the standard output based on whether the sentence is a pangram or not.
The quick brown fox jumps over the lazy dog
True