false otherwise.

Examples

Example 1:

Input: sentence = "thequickbrownfoxjumpsoverthelazydog"
Output: true
Explanation: sentence contains at least one of every letter of the English alphabet.

Example 2:

Input: sentence = "leetcode"
Output: false

Solution

Method 1 – Hash Set for Unique Letters

Intuition

A pangram must contain every letter from 'a' to 'z' at least once. By adding each character in the sentence to a set, we can easily check if all 26 letters are present.

Approach

Initialize an empty set to store unique letters.
Iterate through each character in sentence and add it to the set.
After processing, check if the set size is 26.
Return True if all letters are present, otherwise False.

Related Tags