Easy CPP||maps||beginner friendly||beats 90%users
(Maps)\nCounting Characters: It iterates through each word in the words vector and counts the occurrences of each character, storing the counts in an unordered 
(Maps)\nCounting Characters: It iterates through each word in the words vector and counts the occurrences of each character, storing the counts in an unordered map counts.\n\nChecking if Characters Can Be Distributed Equally: Then, it checks if the count of each character in the counts map is divisible by the total number of words n. If any character count isn\'t evenly divisible by n, it returns false. If all characters meet this condition, it returns true.\n\nComplexity\nTime complexity:\nO(n).kO(n).kO(n).k\n\nSpace complexity:\nO(1)O(1)O(1)\n\n# Code\n```\nclass Solution {\npublic:\n    bool makeEqual(vector<string>& words) {\n        unordered_map<char,int> mp;\n        int n=words.size();\n        for(auto s:words){\n            for(auto c:s){\n                mp[c]++;\n            }\n        }\n        for(auto i:mp){\n            if(i.second%n) return false;\n        }\n        return true;\n    }\n};\n```
['C++']