💡Swift - Optimal Solution - Hash Table
Solution\n\nclass Solution {\n    func makeEqual(_ words: [String]) -> Bool {\n        let n = words.count\n        var freq: [Character: Int] = [:]\n        fo
# Solution\n```\nclass Solution {\n    func makeEqual(_ words: [String]) -> Bool {\n        let n = words.count\n        var freq: [Character: Int] = [:]\n        for word in words {\n            for char in word {\n                freq[char, default: 0] += 1\n            }\n        }\n\n        return freq.values.allSatisfy { $0.isMultiple(of: n) }\n    }\n}\n```\n# Complexity\n- Time: $$O(n)$$\n- Space: $$O(1)$$
['Hash Table', 'Swift']