Anagram Search With Limited Ops | Dataford Interview Questions

How would you find all anagrams in the English language using a computer system that only has basic mathematical functions?

Assume you are given a list of lowercase English words and must group words that are anagrams of each other. Return every group containing at least two words, with each group sorted lexicographically and the groups sorted by their first word.

Function

group_anagrams(words)

Input

words: list of lowercase strings

Output

list of lists of strings, where each inner list contains words that are anagrams

Constraints

1 <= len(words) <= 10^4
1 <= len(words[i]) <= 100
Each word contains only lowercase English letters a to z
Return only groups with at least two words

Function Signature

def group_anagrams(words):

Your question is Anagram Search With Limited Ops. 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