Practice/Goldman Sachs/Leetcode 1832. Check if the Sentence Is Pangram

Leetcode 1832. Check if the Sentence Is Pangram

CodingMust

Problem

Write a function that determines whether a given string contains every letter of the English alphabet at least once. Such a string is called a pangram. The input will consist only of lowercase English letters.

Your function should return true if the string is a pangram (contains all 26 letters from 'a' to 'z'), and false otherwise.

Requirements

1. Check if all 26 lowercase English letters appear in the input string
2. Each letter only needs to appear at least once (duplicates are allowed)
3. Return a boolean indicating whether the string is a pangram
4. The solution should handle empty strings and single-character strings

Constraints

• 0 <= sentence.length <= 1000
• sentence consists only of lowercase English letters
• Time complexity: Aim for O(n) where n is the length of the string
• Space complexity: O(1) since we only track a fixed set of 26 letters

Examples

Example 1:

Input: sentence = "thequickbrownfoxjumpsoverthelazydog" Output: true Explanation: The sentence contains all 26 letters of the alphabet at least once.

Example 2:

Input: sentence = "helloworld" Output: false Explanation: The sentence is missing many letters including 'a', 'b', 'c', and others.

Example 3:

Input: sentence = "abcdefghijklmnopqrstuvwxyz" Output: true Explanation: This sentence contains exactly one of each letter in alphabetical order.