C++ SOLUTION || O(N)
Complexity\n- Time complexity: O(N)\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# Cod
# Complexity\n- Time complexity: O(N)\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    bool makeEqual(vector<string>& words) \n    {\n        unordered_map<char,int> mp;\n        int n = words.size();\n        for(auto &a:words)\n        {\n            for(auto &b:a)\n            {\n                mp[b]++;\n            }\n        }    \n        for(auto &a:mp)\n        {\n            if((a.second)%n)\n            {\n                return 0;\n            }\n        }\n        return 1;\n    }\n};\n```
['Hash Table', 'C++']