JAVA || Using HashMap || easy-understanding
\nclass Solution {\n    public boolean makeEqual(String[] words) {\n        \n        HashMap<Character, Integer> map = new HashMap<>();\n        \n        for(
```\nclass Solution {\n    public boolean makeEqual(String[] words) {\n        \n        HashMap<Character, Integer> map = new HashMap<>();\n        \n        for(String str : words){\n            \n            for(int i=0; i<str.length(); i++){\n                char ch = str.charAt(i);\n                \n                map.put(ch, map.getOrDefault(ch, 0) + 1);\n            }\n            \n        }\n        \n        for(Character key : map.keySet()){\n            \n            int freq = map.get(key);\n            if(freq % words.length!=0){\n                return false;\n            }\n        }\n        \n        return true;\n    }\n}\n```\n\nSolution with less time and space : [Using Count](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/discuss/1268558/Count/974645)
['Java']