Here's the trick: anagrams share the same letters in the same quantities. "eat", "tea", and "ate" all have one 'a', one 'e', and one 't'. How can you identify that two strings are anagrams? Two approaches: Sort both strings. If they're equal, they're anagrams. "eat" → "aet", "tea" → "aet". Count character frequencies. If the counts match, they're anagrams. Use this as a hash map key to group strings together.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/arrays-hashing/group-anagrams-hint
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████████████████