0ms solution
C++ code\n\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence) {\n        vector<short int> s(26);\n\n        // add 1 to corresponding ascii i
# C++ code\n```\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence) {\n        vector<short int> s(26);\n\n        // add 1 to corresponding ascii indexes in vector\n        for(char x:sentence) s[x-\'a\']++;\n\n        // if any of the positions have 0, then that corresponding ascii character is missing\n        // Eg, if sentence[3] is 0, then \'d\' is absent (since \'d\'-\'a\'=3)\n        for (short int x:s) if (x==0) return false;\n        \n        // return true if all characters is present\n        return true;\n    }\n};\n```\n\nFeel free to ask away any doubts you have
['C++']