#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/data-structures/hash-tables/group-anagrams-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/data-structures/hash-tables/group-anagrams-implementation

Repovive

Group Anagrams - Implementation - Hash Tables | Data Structures | Repovive

Repovive.

Data Structures19 sections · 729 units49h total

Open in Course

Group Anagrams - Implementation

Complete solution

Here's the solution using sorted keys:

function groupAnagrams(strs)
    groups := empty hash map  // sorted string -> list of strings

    for each str in strs
        key := sort characters of str
        if key not in groups
            groups[key] := empty list
        append str to groups[key]

    return all values in groups

Time: $O(n \cdot k \log k)$ where $n$ is the number of strings and $k$ is the maximum string length. Space: $O(nk)$ .