A pangram is defined as a sentence that contains every letter of the English alphabet at least once.

Given a string sentence containing only lowercase English letters, return true if sentence is a pangram, or false otherwise.

Constraints:

• $1 \leq$ sentence.length $\leq 1000$

• sentence consists of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.