C++ solution using set
\nclass Solution {\npublic:\n    int countConsistentStrings(string allowed, vector<string>& words){\n        int ret = words.size();\n        set <char> s(allow
```\nclass Solution {\npublic:\n    int countConsistentStrings(string allowed, vector<string>& words){\n        int ret = words.size();\n        set <char> s(allowed.begin(), allowed.end());\n        for(int i = 0; i < words.size(); i++){\n            vector<char> ch(words[i].begin(), words[i].end());\n            for(int j = 0; j < ch.size(); j++){\n                if(s.count(ch[j]) == 0){\n                    ret -= 1;\n                    break;\n                }\n            }\n        }\n        return ret;\n    }\n};\n```\nThankyou !! if u find this easy please Upvote mate
[]