C++ easy solution
class Solution {\npublic:\n    int countConsistentStrings(string allowed, vector& words) {\n\t\n        unordered_mapmp;\n        for(auto &it:allowed)mp[it]++;
class Solution {\npublic:\n    int countConsistentStrings(string allowed, vector<string>& words) {\n\t\n        unordered_map<char,int>mp;\n        for(auto &it:allowed)mp[it]++;\n        int ans=0;\n        bool x=true;\n        for(int i=0;i<words.size();i++)\n        {\n            x=true;\n            for(auto &it:words[i])\n            {\n                if(mp.find(it)==mp.end())x=false;\n            }\n            if(x==true)ans++;\n        }\n        return ans;\n    }\n};\n**Please do upvote!**
['C']