Group Anagrams with Hash Map | Dataford Interview Questions

Given a list of anagrams, group anagrams by their sorted values (hint: the best solution uses a hash map).

Implement group_anagrams(words), where words is a list of lowercase strings. Return a list of groups, preserving the input order within each group and ordering groups by the first occurrence of their key. Two words belong to the same group when sorting their characters produces the same value.

The input may be empty, and duplicate words should remain duplicated in the output.

Constraints

0 <= len(words) <= 10^4
0 <= len(words[i]) <= 100
Each word contains only lowercase English letters
Duplicate words must remain in their group

Function Signature

def group_anagrams(words):

Your question is Group Anagrams with Hash Map. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given a list of anagrams, group anagrams by their sorted values (hint: the best solution uses a hash map).

The input may be empty, and duplicate words should remain duplicated in the output.

Constraints

0 <= len(words) <= 10^4
0 <= len(words[i]) <= 100
Each word contains only lowercase English letters
Duplicate words must remain in their group

Function Signature

def group_anagrams(words):

Your question is Group Anagrams with Hash Map. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.