easy
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:   \n    bool checkIfPangram(string s) {\n        vector<int>v(26);\n        for(int p=0;p<s.length();p++){\n            v[s[p]-97]++;\n        }\n        for(int p=0;p<26;p++){\n            if(v[p]==0){\n                return false;\n            }\n        }\n        return true;\n    }\n};\n```
['C++']