Python   ||      2 lines, sets   ||      T/S: 94% / 99%
\nclass Solution:\n    def checkIfPangram(self, sentence: str) -> bool:\n\n        return  len(set(sentence)) == 26\n\nhttps://leetcode.com/problems/check-if-th
```\nclass Solution:\n    def checkIfPangram(self, sentence: str) -> bool:\n\n        return  len(set(sentence)) == 26\n```\n[https://leetcode.com/problems/check-if-the-sentence-is-pangram/submissions/599255950/](https://leetcode.com/problems/check-if-the-sentence-is-pangram/submissions/599255950/)\n\nI could be wrong, but I think that time complexity is *O*(*N*) and space complexity is *O*(*N*), in which *N* ~ `len(sentence)`.
['Python', 'Python3']