SOUTION - n(0) Time Complexity✅ 100% Beats✅
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean makeEqual(String[] words) {\n        Map<Character, Integer> charCount = new HashMap<>();\n        for (String word : words) {\n            for (char c : word.toCharArray()) {\n                charCount.put(c, charCount.getOrDefault(c, 0) + 1);\n            }\n        }\n        int numStrings = words.length;\n        for (int count : charCount.values()) {\n            if (count % numStrings != 0) {\n                return false;\n            }\n        }\n        return true;\n    }\n}\n```
['Java']