##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
The trap
You might compare every pair of strings to check if they're anagrams. For each pair, you'd compare character counts in O(k) time where k is string length.
With n strings, that's O(n2) pairs. Total: O(n2⋅k).
For n=104 strings of length 100, that's roughly 1010 operations. Way too slow.
You need a way to identify anagrams without comparing every pair directly.
