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.

Restricciones

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

Ejemplos

Entrada:
text = "The quick brown fox jumps over the lazy dog."

Salida esperada:
expected = True

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

Salida esperada:
bool expected = true;

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

Salida esperada:
bool expected = true;

Entrada:
text = "abcdefghijklmnopqrstuvwxy"

Salida esperada:
expected = False

Entrada:
std::string text = "abcdefghijklmnopqrstuvwxy";

Salida esperada:
bool expected = false;

Entrada:
string text = "abcdefghijklmnopqrstuvwxy";

Salida esperada:
bool expected = false;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• Exercism: Pangram