c++ || self explanatory
\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence) {\n        vector<int> vec(26,0);\n        for(char ch : sentence){\n            vec[ch-\'
```\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence) {\n        vector<int> vec(26,0);\n        for(char ch : sentence){\n            vec[ch-\'a\']++;\n        }\n        int zero_count = count(vec.begin(), vec.end(), 0);\n        return zero_count==0;\n    }\n};\n``` \n\n```\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence) {\n        unordered_set<char> set(sentence.begin(), sentence.end());\n        return set.size() == 26;\n    }\n};\n```\n**Feel free to ask any question in the comment section.**\nI hope that you\'ve found the solution useful.\nIn that case,**please do upvote and encourage me** to on my quest to document all leetcode problems\uD83D\uDE03\nHappy Coding :)\n
['C', 'C++']