[Python\C++] Simplest solution- Set (Beats 100% )
Python beats 100%\n\ndef countConsistentStrings(self, allowed: str, words: List[str]) -> int:\n        incomp = 0\n        sett = set(allowed)\n        for word
Python beats 100%\n```\ndef countConsistentStrings(self, allowed: str, words: List[str]) -> int:\n        incomp = 0\n        sett = set(allowed)\n        for word in words:\n            for c in word:\n                if(c not in sett):\n                    incomp+=1\n                    break\n        return len(words) - incomp\n```\n\nC++\n```\nint countConsistentStrings(string allowed, vector<string>& words) {\n        int incomp = 0;\n        unordered_set<char> sett ;\n        for(char c: allowed)\n            sett.insert(c);\n        \n        for(string word : words){\n            for(char c: word){\n                if(sett.find(c)==sett.end()){\n                     incomp+=1;\n                        break;\n                }\n            }\n        }\n            \n        return words.size()- incomp;\n    }\n```
[]