[C++] Simple Solution || O(N) || Easy Understanding
C++ solution:\n\nclass Solution {\npublic:\n    bool checkIfPangram(string s) {\n        vector<int>vis(26,0);\n        int count=0;\n        for(auto i:s)\n   
**C++ solution:**\n```\nclass Solution {\npublic:\n    bool checkIfPangram(string s) {\n        vector<int>vis(26,0);\n        int count=0;\n        for(auto i:s)\n        {\n            if(!vis[i-\'a\'])\n            {\n                vis[i-\'a\']=1;\n                count++;\n            }\n        }\n        if(count>=26)\n            return 1;\n        return 0;\n        \n    }\n};\n```
['C']