Prep RoomSign inStart free
Code RoomAnagram groups
MediumPrep Room Coding #569

Anagram groups

CodingAlgorithms & data structuresEntry–Mid~15 min

A word game bans usernames that are merely shuffles of one another, so the moderation team wants to know how many truly different names exist. Given a list of lowercase usernames, return the number of anagram groups: names that are anagrams of each other (same letters, same multiplicities) belong to one group. For example, ['listen', 'silent', 'enlist', 'google'] has 2 groups.

Implement
anagram_group_count(names: list[str]) → int
Examples
in[["listen","silent","enlist","google"]]out2
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 15 min
InputExpectedGot
[["listen","silent","enlist","google"]]2not run yetsample