Python easy solution using dictionary
```\nclass Solution:\n    def checkIfPangram(self, sentence: str) -> bool:\n        appear = {}\n        for i in sentence:\n            if i not in appear:\n  
```\nclass Solution:\n    def checkIfPangram(self, sentence: str) -> bool:\n        appear = {}\n        for i in sentence:\n            if i not in appear:\n                appear[i] = 1\n            else:\n                appear[i] += 1\n        if len(appear) == 26:\n            return True\n        return False
['Hash Table', 'Python']