Why Group Anagrams Using Hash Map in DSA Javascript?

The Big Idea

What if you could find all matching word puzzles in seconds instead of hours?

The Scenario

Imagine you have a big list of words, and you want to find which words are anagrams of each other -- that means they have the same letters but in a different order, like "listen" and "silent".

If you try to do this by checking every word against every other word manually, it quickly becomes a huge mess.

The Problem

Checking each pair of words one by one takes a lot of time, especially if the list is long. It's easy to make mistakes or miss some pairs because the process is slow and confusing.

This manual way is like trying to find matching socks in a huge pile without sorting them first -- it's tiring and error-prone.

The Solution

Using a hash map, we can group words by their sorted letters. This means all anagrams will share the same key in the map, making it easy to collect them together quickly and without mistakes.

It's like sorting socks by color first, so matching pairs are right next to each other.

Before vs After

✗ Before

for (let i = 0; i < words.length; i++) {
  for (let j = i + 1; j < words.length; j++) {
    if (areAnagrams(words[i], words[j])) {
      // group them
    }
  }
}

✓ After

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

What It Enables

This lets us quickly find and group all anagrams in a list, no matter how big, with simple and clear code.

Real Life Example

Think about a spell-checker or word game app that needs to find all words made from the same letters fast -- grouping anagrams helps it work smoothly and quickly.

Key Takeaways

Manual pairwise checks are slow and error-prone.

Hash maps group words by sorted letters to find anagrams easily.

This method is fast, clear, and works well even for large lists.

Practice

1. What is the main idea behind grouping anagrams using a hash map?

easy

A. Group words by their length using a hash map

B. Count the number of vowels in each word and group by count

C. Use the first letter of each word as the key in the hash map

D. Use sorted strings as keys to group words with the same letters

Solution

1. Step 1: Understand anagrams

   Anagrams are words with the same letters in different orders, so sorting letters gives a unique key.

2. Step 2: Use sorted string as hash map key

   By sorting each word and using it as a key, all anagrams map to the same key and can be grouped.

3. Final Answer:

   Use sorted strings as keys to group words with the same letters -> Option D

4. Quick Check:

   Sorted word keys group anagrams = C [OK]

Hint: Sort each word to find its anagram group key [OK]

Common Mistakes:

• Grouping by word length only
• Using first letter as key
• Counting vowels instead of letters

2. Which of the following JavaScript code snippets correctly initializes an empty hash map to group anagrams?

easy

A. const map = {};

B. const map = Map();

C. const map = [];

D. const map = new Set();

Solution

1. Step 1: Identify hash map initialization in JavaScript

   JavaScript objects ({}) are commonly used as hash maps for key-value pairs.

2. Step 2: Analyze the options

   {} creates a simple hash map using bracket notation like map[key]. Map() without new throws TypeError. [] creates an array unsuitable for key-value pairs. new Set() stores unique values, not mappings.

3. Final Answer:

   const map = {}; -> Option A

4. Quick Check:

   Object literal {} is simplest hash map = A [OK]

Hint: Use {} to create a simple hash map in JavaScript [OK]

Common Mistakes:

• Using array [] instead of object
• Using Set which doesn't store key-value pairs
• Confusing Map and object initialization

3. What is the output of the following code?

function groupAnagrams(words) {
  const map = {};
  for (const word of words) {
    const sorted = word.split('').sort().join('');
    if (!map[sorted]) map[sorted] = [];
    map[sorted].push(word);
  }
  return Object.values(map);
}

console.log(groupAnagrams(['bat', 'tab', 'eat', 'tea', 'ate']));

medium

A. SyntaxError

B. [['bat'], ['tab'], ['eat'], ['tea'], ['ate']]

C. [['bat', 'tab'], ['eat', 'tea', 'ate']]

D. [['bat', 'tab', 'eat', 'tea', 'ate']]

Solution

1. Step 1: Sort each word and group in map

   Words 'bat' and 'tab' both sort to 'abt', so grouped together. 'eat', 'tea', 'ate' all sort to 'aet', grouped together.

2. Step 2: Return grouped anagrams as array of arrays

   Object.values(map) returns arrays of grouped words: [['bat', 'tab'], ['eat', 'tea', 'ate']].

3. Final Answer:

   [['bat', 'tab'], ['eat', 'tea', 'ate']] -> Option C

4. Quick Check:

   Sorted keys group words = [['bat','tab'],['eat','tea','ate']] [OK]

Hint: Sort words, group by sorted key, return grouped arrays [OK]

Common Mistakes:

• Returning flat list instead of grouped arrays
• Not sorting words before grouping
• Syntax errors from missing brackets

4. Find the error in this code snippet for grouping anagrams:

function groupAnagrams(words) {
  const map = {};
  for (const word of words) {
    const sorted = word.sort().join('');
    if (!map[sorted]) map[sorted] = [];
    map[sorted].push(word);
  }
  return Object.values(map);
}

medium

A. map should be initialized as a Map object

B. word.sort() is invalid because word is a string, not an array

C. Missing return statement

D. Using Object.values on map is incorrect

Solution

1. Step 1: Identify the error in sorting

   word is a string, and strings do not have a sort() method. It must be split into an array first.

2. Step 2: Correct approach to sort letters

   Use word.split('').sort().join('') to sort letters of the string correctly.

3. Final Answer:

   word.sort() is invalid because word is a string, not an array -> Option B

4. Quick Check:

   Strings need split() before sort() = B [OK]

Hint: Split string to array before sorting letters [OK]

Common Mistakes:

• Calling sort() directly on string
• Not splitting string before sorting
• Confusing Map object with plain object

5. Given the input array ['listen', 'silent', 'enlist', 'google', 'gogole', 'abc', 'cab'], which of the following is the correct grouped anagrams output using a hash map approach?

hard

A. [['listen', 'silent', 'enlist'], ['google', 'gogole'], ['abc', 'cab']]

B. [['listen', 'silent'], ['enlist', 'google'], ['gogole', 'abc', 'cab']]

C. [['listen'], ['silent'], ['enlist'], ['google'], ['gogole'], ['abc'], ['cab']]

D. [['listen', 'silent', 'enlist', 'google', 'gogole', 'abc', 'cab']]

Solution

1. Step 1: Sort each word to find keys

   'listen', 'silent', 'enlist' all sort to 'eilnst'; 'google', 'gogole' sort to 'eggloo'; 'abc', 'cab' sort to 'abc'.

2. Step 2: Group words by sorted keys

   Group words with same sorted key together: [['listen', 'silent', 'enlist'], ['google', 'gogole'], ['abc', 'cab']].

3. Final Answer:

   [['listen', 'silent', 'enlist'], ['google', 'gogole'], ['abc', 'cab']] -> Option A

4. Quick Check:

   Sorted keys group anagrams correctly = A [OK]

Hint: Sort letters, group by key, collect arrays [OK]

Common Mistakes:

• Mixing groups with different sorted keys
• Grouping by word length instead of letters
• Returning flat list instead of grouped arrays