✔ Easiest C++ Solution
Please UPVOTE if the solution is helpful :)\n```\nint countConsistentStrings(string allowed, vector& words) {\n        mapmp;\n        int c=0;\n        for(int
**Please UPVOTE if the solution is helpful :)**\n```\nint countConsistentStrings(string allowed, vector<string>& words) {\n        map<char,int>mp;\n        int c=0;\n        for(int i=0;i<allowed.length();i++)\n        {\n            mp[allowed[i]]++;\n        }\n        for(int i=0;i<words.size();i++)\n        {\n            bool p=true;\n            for(int j=0;j<words[i].length();j++)\n            {\n                if(mp.find(words[i][j])==mp.end())\n                   p=false;\n            }\n            if(p) c++;\n        }\n        return c;\n    }
['C']