Bit Manipulation approach | C++
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```\nclass Solution {\npublic:\n    int countConsistentStrings(string allowed, vector<string>& words) {\n        int x=0,ans=0;\n        for(auto it:allowed)\n        x=x|(1<<(it-\'a\'));\n        for(auto it:words)\n        {\n            ans++;\n            for(auto ch:it)\n            {\n                if(((x>>(ch-\'a\'))&1)==0)\n                {ans--;\n                break;}\n            }\n        }\n        return ans;\n        \n        \n        \n        }\n};\n```
['C++']