Daily LeetCoding Challenge October, Day 17
The approach followed here is very simple. We store the frequency of charecters in an array or a vector. Then we simply traverse through the array or vector to 
The approach followed here is very simple. We store the frequency of charecters in an array or a vector. Then we simply traverse through the array or vector to check if element is present at least once.\n\n```\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence)\n    {\n        int start=\'a\',end=\'z\';\n        vector<int> a(26,0);\n        for(char ch:sentence)\n        {\n            if(!(ch>=start && ch<=end))\n                return false;\n            a[ch-\'a\']++;\n        }\n        for(int i:a)\n            if(i<1)\n                return false;\n        return true;\n    }\n};\n```
['Array', 'String', 'C']