#string#set#easiest solution
\n\nclass Solution {\npublic:\n    int countConsistentStrings(string allowed, vector<string>& nums) {\n        int c=0;\n        set<char>k(allowed.begin(),allo
\n```\nclass Solution {\npublic:\n    int countConsistentStrings(string allowed, vector<string>& nums) {\n        int c=0;\n        set<char>k(allowed.begin(),allowed.end());\n       int ans=nums.size();\n        for(auto it:nums){\n            for(int i=0;i<it.length();i++){\n                if(k.find(it[i])==k.end()){\n\n                ans--;\n                break;\n                }\n            }\n           \n\n        }\n        return ans;\n    }\n};\n```
['C++']