Question
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.
anagram_group_count(names: list[str]) → int[["listen","silent","enlist","google"]]out2State 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.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.