C++ easy solution
\tclass Solution {\n\tpublic:\n\t\tint countConsistentStrings(string allowed, vector& words) {\n\n\t\t\tint map[26] = {0} , ans = 0;\n\t\t\tfor(auto& x:allowed)
\tclass Solution {\n\tpublic:\n\t\tint countConsistentStrings(string allowed, vector<string>& words) {\n\n\t\t\tint map[26] = {0} , ans = 0;\n\t\t\tfor(auto& x:allowed) map[x-\'a\']++;\n\n\t\t\tfor(auto& word : words){\n\t\t\t\tbool isConsistent = true;\n\t\t\t\tfor(auto& ch: word){ \n\t\t\t\t\tif(map[ch - \'a\'] == 0){\n\t\t\t\t\t\tisConsistent = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(isConsistent) ans++;     \n\t\t\t}\n\n\t\t\treturn ans;\n\t\t}\n\t};
['C', 'C++']