C++ Easy Solution.
IntuitionApproachComplexity
Time complexity:O(N)

Space complexity:O(N)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:O(N)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:O(N)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    bool makeEqual(vector<string>& words) {
        map<char,int>cnt;
        for(auto u:words) 
        {
            for(auto g:u) cnt[g]++;
        }
        for(auto u:cnt){
            if(u.second%words.size()!=0) return false;
        }
        return true;
    }
};
```
['C++']