Pangram
A pangram (Greek: παν γράμμα, pan gramma, "every letter") or holoalphabetic sentence for a given alphabet is a sentence using every letter of the alphabet at least once. Perhaps you are familiar with the well known pangram "The quick brown fox jumps over the lazy dog".
For this mission, we will use the latin alphabet (A-Z). You are given a text with latin letters and punctuation symbols. You need to check if the sentence is a pangram or not. Case does not matter.
Input: A text as a string (string).
Output: Whether the sentence is a pangram or not as logic value (boolean).
Examples:
assert.strictEqual(
checkPangram("The quick brown fox jumps over the lazy dog."),
true
);
assert.strictEqual(checkPangram("ABCDEF"), false);
assert.strictEqual(checkPangram("abcdefghijklmnopqrstuvwxyz"), true);
assert.strictEqual(checkPangram("ABCDEFGHIJKLMNOPQRSTUVWXYZ"), true);
How it is used: Pangrams have been used to display typefaces, test equipment, and develop skills in handwriting, calligraphy, and keyboarding for ages.
Precondition:
All ASCII English Letter(a-z,A-Z) and punctuations such as:!"#$%&\'()*+,-./:;<=>?@[\\]^_`{|}~
