Java O(n) solution -Count
\nclass Solution {\n    public boolean makeEqual(String[] words) {\n        int[] count = new int[26];\n        for(String key : words){\n            for(int i 
```\nclass Solution {\n    public boolean makeEqual(String[] words) {\n        int[] count = new int[26];\n        for(String key : words){\n            for(int i =0;i<key.length();i++){\n                count[ key.charAt(i) - \'a\']++;\n            }\n        }\n        \n        for(int i=0;i<count.length;i++){\n            if(count[i]!=0 && count[i] % words.length !=0){\n                return false;\n            }\n        }\n         return true;\n    }\n}\n```
[]