Easiest Intutive C++ solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n## - Ti
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n## - Time complexity:O(n2)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n## - Space complexity:O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int countConsistentStrings(string all, vector<string>& w) {\n        map<char,int> mp;int d=0,c;\n        for(auto i:all)\n        {\n            mp[i]++;\n        }\n\n        for(auto word:w)\n        {\n            for(auto i: word)\n            {\n                if(mp.find(i)==mp.end())\n                {\n                    c=1;\n                    break;\n                }\n            }\n            if(c!=1){\n            d++;\n           }\n            c=0;\n        }\n        return d;\n\n        \n        \n    }\n};\n```
['Array', 'Hash Table', 'String', 'C++']