2MS JAVA Solution
class Solution {\n    public boolean makeEqual(String[] words) {\n        if(words.length==1)return true;\n        int[] arr = new int[26];\n        for(int i=0
class Solution {\n    public boolean makeEqual(String[] words) {\n        if(words.length==1)return true;\n        int[] arr = new int[26];\n        for(int i=0; i<words.length; i++){\n            String s = words[i];\n            for(int j=0; j<s.length(); j++){\n                arr[s.charAt(j)-\'a\']++;\n            }\n        }\n        int n = words.length;\n        for(int i=0; i<26; i++){\n            if(arr[i]!=0 && arr[i]%n!=0)return false;\n        }\n        return true;\n    }\n}
['Hash Table', 'Java']