You are given an array of strings. Your task is to group the strings that are anagrams of each other. Two strings are anagrams if they contain the same characters in the same frequency, but the order of characters does not matter.

A common approach is to use a hash map where the key is a canonical representation of each string and the value is a list of strings that match that key. Two canonical forms are popular:

1. Sorted string – sort the characters of each string (O(k log k) per string, where k is the string length). Use the sorted string as the key.
2. Character count – build a 26‑element array (or a 256‑element array for full ASCII) counting each character. Convert the array to a string or tuple to use as the key. This is O(k) per string.

Algorithm:

1. Initialize an empty map.
2. For each string s in the array:

• Compute its key (sorted or count).
• Append s to map[key].

1. Return the list of all map values.

Complexity: If using sorting, time is O(n k log k) and space is O(n k). Using counting reduces time to O(n * k) while keeping space similar. The algorithm is straightforward, works for any alphabet, and handles duplicates naturally.