[Java/Python 3] Count all chars then check if all frequencies can be divided without remaining.
java\n    public boolean makeEqual(String[] words) {\n        int[] cnt = new int[26];\n        for (String w : words) {\n            for (int i = 0; i < w.leng
```java\n    public boolean makeEqual(String[] words) {\n        int[] cnt = new int[26];\n        for (String w : words) {\n            for (int i = 0; i < w.length(); ++i) {\n                ++cnt[w.charAt(i) - \'a\'];\n            }\n        }\n        for (int i = 0, n = words.length; i < 26; ++i) {\n            if (cnt[i] % n != 0) {\n                return false;\n            }\n        }\n        return true;\n    }\n```\n```python\n    def makeEqual(self, words: List[str]) -> bool:\n        return all(val % len(words) == 0 for val in Counter(reduce(add, words)).values())\n```
[]