✔️ Java O(N + K) Solution
Complexity\n- Time complexity: O(N + K), where N - number of chars in words, K - 26 alphabet lowercase letters\n\n\n# Code\n\nclass Solution {\n    public boole
# Complexity\n- Time complexity: O(N + K), where N - number of chars in words, K - 26 alphabet lowercase letters\n\n\n# Code\n```\nclass Solution {\n    public boolean makeEqual(String[] words) {\n        int[] alph = new int[26];\n        for (String word : words) for (char c : word.toCharArray()) alph[c - \'a\']++;\n        for (int n : alph) if (n % words.length != 0) return false;\n        return true;\n    }\n}\n```
['Java']