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