728x90
https://leetcode.com/problems/check-if-the-sentence-is-pangram
class Solution:
def checkIfPangram(self, sentence: str) -> bool:
alphabet = {
'a':0, 'b':0, 'c':0, 'd':0, 'e':0, 'f':0, 'g':0, 'h':0, 'i':0,
'j':0, 'k':0, 'l':0, 'm':0, 'n':0, 'o':0, 'p':0, 'q':0, 'r':0,
's':0, 't':0, 'u':0, 'v':0, 'w':0, 'x':0, 'y':0, 'z':0
}
for n in sentence:
alphabet[n] += 1
for key, value in alphabet.items():
if value == 0:
return False
return True
728x90
'IT > 코딩테스트' 카테고리의 다른 글
[Leetcode] 804. Unique Morse Code Words (0) | 2024.02.23 |
---|---|
[Leetcode] 1684. Count the Number of Consistent Strings (0) | 2024.02.23 |
[Leetcode] 2006. Count Number of Pairs With Absolute Difference K (0) | 2024.02.22 |
[Leetcode] 2367. Number of Arithmetic Triplets (0) | 2024.02.22 |
[Leetcode] 2325. Decode the Message (0) | 2024.02.21 |