#4 Medium O(m·n·log n) O(m·n) Animated

Group Anagrams

Group an array of strings so that anagrams are together.

LeetCode ↗

Approach: Hash Map with Character Count Array

Click play to start

Step 0 / 0

Press play to start the visualization.

1×

Description

Group an array of strings so that anagrams are together.

Constraints

Time Complexity: O(m·n·log n)
Space Complexity: O(m·n)

Solution — Hash Map with Character Count Array

O(m·n·log n) O(m·n)

def groupAnagrams(strs):
    res = defaultdict(list)
    for s in strs:
        count = [0] * 26
        for c in s:
            count[ord(c) - ord('a')] += 1
        res[tuple(count)].append(s)
    return list(res.values())

Two Sum

Top K Frequent Elements

Group Anagrams

Steps

Description

Constraints

Tags

Solution — Hash Map with Character Count Array