C++ Solution
Complexity\n- Time complexity:\n Add your time complexity here, e.g. O(n) \n    O(N)\n\n- Space complexity:\n Add your space complexity here, e.g. O(n) \n    O(
# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n    O(N)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n    O(1)\n\n# Code\n```\nclass Solution {\npublic:\n    bool makeEqual(vector<string>& words) {\n        int n = words.size();\n        unordered_map<char, int> mp;\n        for(auto word : words) {\n            for(auto c : word) mp[c]++;\n        }\n        for(auto x : mp) {\n            if(x.second % n) return false;\n        }\n        return true;\n    }\n};\n```
['C++']