C++ | Easy O(1) space complexity.
Approach \nUsed int(32 bits) to update the occurence of characters. Since we know that total count will not be greater than 26. \n Describe your approach to sol
# Approach \nUsed int(32 bits) to update the occurence of characters. Since we know that total count will not be greater than 26. \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(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool checkIfPangram(string s) {\n        int x=0;\n        for(int i=0;i<s.size();i++){\n            x = x | (1<<(s[i]-\'a\'));\n        }\n       return (x == (1<<26) -1);\n    }\n};\n```
['C++']