mirror of
https://github.com/prdlk/leetcode.git
synced 2026-09-17 07:26:27 +00:00
41 lines
960 B
Python
41 lines
960 B
Python
|
"""
|
||
|
|
1832. Check if the Sentence Is Pangram
|
||
|
|
Difficulty: Easy
|
||
|
|
https://leetcode.com/problems/check-if-the-sentence-is-pangram/
|
||
|
|
|
||
|
|
──────────────────────────────────────────────────
|
||
|
|
|
||
|
|
A pangram is a sentence where every letter of the English alphabet
|
||
|
|
appears at least once.
|
||
|
|
|
||
|
|
Given a string sentence containing only lowercase English letters,
|
||
|
|
return true if sentence is a pangram, or false otherwise.
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
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
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
Constraints:
|
||
|
|
|
||
|
|
• 1 <= sentence.length <= 1000
|
||
|
|
|
||
|
|
• sentence consists of lowercase English letters.
|
||
|
|
"""
|
||
|
|
|
||
|
|
|
||
|
|
class Solution:
|
||
|
|
def checkIfPangram(self, sentence: str) -> bool:
|
||
|
|
return len(set(sentence.lower())) == 26
|