3 line solution easy understanding c++ and unordered_map
1 we declayer an unordered map of type \n2 loop through each letter in string and place it in unordered map\n3 if size of map is equal to 26 then all the letter
1 we declayer an unordered map of type <char,int>\n2 loop through each letter in string and place it in unordered map\n3 if size of map is equal to 26 then all the letters are included\n```\nclass Solution {\npublic:\n    bool checkIfPangram(string sentence) {\n        unordered_map<char,int> mappa;\n        for(int i=0;i<sentence.size();++i)mappa[sentence[i]]++;\n        return 26 == mappa.size();\n    }\n};
['C']