Pangram Check

A pangram contains every English letter at least once. Determine whether the text is a pangram. Ignore case, spaces, digits, and punctuation.

Implement pangram_check(text).

Input

text: The text to inspect.

Output

Return true if all 26 letters appear, otherwise false.

Contraintes

0 ≤ text length ≤ 100,000. Input contains printable ASCII characters. Only letters A–Z and a–z count.

Exemples

Entrée :
text = "The quick brown fox jumps over the lazy dog."

Sortie attendue :
expected = True

Entrée :
std::string text = "The quick brown fox jumps over the lazy dog.";

Sortie attendue :
bool expected = true;

Entrée :
string text = "The quick brown fox jumps over the lazy dog.";

Sortie attendue :
bool expected = true;

Entrée :
text = "abcdefghijklmnopqrstuvwxy"

Sortie attendue :
expected = False

Entrée :
std::string text = "abcdefghijklmnopqrstuvwxy";

Sortie attendue :
bool expected = false;

Entrée :
string text = "abcdefghijklmnopqrstuvwxy";

Sortie attendue :
bool expected = false;

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• Exercism: Pangram