Print Anagrams Together | Practice Medium 0 attempts
GeeksforGeeks ↗

Print Anagrams Together | Practice

Medium Tries GeeksforGeeks

You get an array of strings. Group them so that words that are anagrams of each other sit in the same group. Two strings are anagrams if they use the same multiset of letters (same counts, order may differ). The order of groups and the order of words inside a group can be any valid arrangement unless the problem statement on the judge says otherwise.

Empty strings are anagrams of each other.

Example 1

  • Input: words = ["eat", "tea", "tan", "ate", "nat", "bat"]
  • Output: [["bat"], ["nat", "tan"], ["ate", "eat", "tea"]] (or any grouping equivalent up to order)

Example 2

  • Input: words = [""]
  • Output: [[""]]

Example 3

  • Input: words = ["a"]
  • Output: [["a"]]

Constraints

  • 1 <= N <= 100 where N is words.length
  • 1 <= words[i].length <= 10
  • Letters are lowercase English unless your judge says otherwise
Sample Input
—
Sample Output
—
Constraints
  • 1 <= N <= 100
  • 1 <= |words[i]| <= 10
Topics
Tries

Hash Map with Sorted Key

function groupAnagrams(words) {
  const map = new Map();
  for (const w of words) {
    const key = w.split('').sort().join('');
    if (!map.has(key)) map.set(key, []);
    map.get(key).push(w);
  }
  return [...map.values()];
}

Time: O(n × k log k) | Space: O(n × k)

Saved in this browser only. Private to you.

JavaScript