Simple unordered map solution || c++
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: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O{n}\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence) {\n        if(sentence.size() < 26)\n            return false;\n        \n        unordered_map<char, int> mp;\n\n        for(int i=0; i<sentence.size(); i++){\n            mp[sentence[i]]++;\n        }\n        if(mp.size() == 26) return 1;\n        return 0;\n    }\n};\n```
['Array', 'Hash Table', 'C++']