Using Set and Subset Method || C++ || Beginner friendly
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 
# 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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    bool sub(set<char> a,set<char> b){\n        for(auto e:b){\n                if(a.find(e)==a.end()){\n                    return 0;\n                }\n        }\n        return 1;\n    }\n    int countConsistentStrings(string allowed, vector<string>& words) {\n        set<char> s(allowed.begin(),allowed.end());\n        int count=0;\n        for(auto i:words){\n            set<char> m(i.begin(),i.end());\n            if(sub(s,m)){count++;}\n            }\n        return count;\n    }\n};\n```
['C++']