[Java/C++/Python] Set Solution
\n# Explanation\nPut all characters in a set,\nreturn if the size of set equals to 26.\nCan return earlier if you like.\n\n\n# Complexity\nTime O(n)\nSpace O(26
\n# **Explanation**\nPut all characters in a set,\nreturn if the size of set equals to 26.\nCan return earlier if you like.\n<br>\n\n# **Complexity**\nTime `O(n)`\nSpace `O(26)`\n<br>\n\n**Java**\n```java\n    public boolean checkIfPangram(String sentence) {\n        Set<Character> s = new HashSet<>();\n        for (int i = 0; i < sentence.length(); ++i)\n            s.add(sentence.charAt(i));\n        return s.size() == 26;\n    }\n```\n\n**C++**\n```cpp\n    bool checkIfPangram(string sentence) {\n        set<int> s;\n        for (auto& c: sentence)\n            s.insert(c);\n        return s.size() == 26;\n    }\n```\n**C++, 1-line**\nby @alvin-777\n```cpp\n    bool checkIfPangram(string s) {\n        return set<char>(s.begin(), s.end()).size() == 26;\n    }\n```\n**Python**\n```py\n    def checkIfPangram(self, s):\n        return len(set(s)) == 26\n```\n
[]