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.

Vincoli

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

Esempi

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

Output atteso:
expected = True

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

Output atteso:
bool expected = true;

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

Output atteso:
bool expected = true;

Input:
text = "abcdefghijklmnopqrstuvwxy"

Output atteso:
expected = False

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

Output atteso:
bool expected = false;

Input:
string text = "abcdefghijklmnopqrstuvwxy";

Output atteso:
bool expected = false;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• Exercism: Pangram