📌C++ || 100% Runtime || Explained || ✅⭐⭐⭐
\n# My simple and fast solution (beats 100% Runtime\uD83D\uDD25and 82.91% in memory)\n\n\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence) {\
\n# **My simple and fast solution (beats 100% Runtime\uD83D\uDD25and 82.91% in memory)**\n\n```\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence) {\n        int arr[26] = {0};\n\t\t//First traverse every letter of sentence in arr and increase its count if found\n        for(int i=0; i<sentence.length(); i++){\n            arr[sentence[i] - \'a\']++;\n        }\n\t\t\n\t\t//Then traverse through the arr and see if any element has 0 count\n        for(int i=0; i<26; i++){\n\t\t\t//if count = 0, then return False\n            if(arr[i] == 0){\n                return false;\n            }\n        }\n\t\t\n\t\t//if you have reached here then every letter is there so return True\n        return true;\n    }\n};\n\n```\n                 ** If you like the solution and understand it then Please Upvote.\uD83D\uDC4D**\n\t\t\t\t* PEACE OUT LUV\u270C\uFE0F*\n\n
['Array', 'C', 'C++']