hash set || Betas others
\n\n# Code\n\nclass Solution {\npublic:\n    int countConsistentStrings(string allowed, vector<string>& words) {\n        unordered_set<char>st(allowed.begin(),
\n\n# Code\n```\nclass Solution {\npublic:\n    int countConsistentStrings(string allowed, vector<string>& words) {\n        unordered_set<char>st(allowed.begin(),allowed.end());\n        int cnt=0;\n        for(int i=0;i<words.size();i++){\n            string temp=words[i];\n            bool ispresent=true;\n            for(int j=0;j<temp.length();j++){\n                if(st.find(temp[j])==st.end()){\n                    ispresent=false;break;\n                }\n            }\n            if(ispresent)cnt++;\n        }\n        return cnt;\n        \n    }\n};\n```
['Hash Table', 'C++']