Why Hash Map Exists and What Problem It Solves in DSA Javascript - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

Why do we use a hash map instead of a list for key-value storage?

Imagine you want to store and quickly find phone numbers by name. You have two options: a list of pairs (name, number) or a hash map. Why is a hash map better for this?

A Because a hash map stores items in order, making it easier to read.

B Because a list automatically sorts the phone numbers alphabetically.

C Because a list uses less memory than a hash map, so it is faster.

D Because a hash map can find a phone number by name in constant time, while a list requires checking each item one by one.

💡 Hint

Think about how long it takes to find an item in a list versus a hash map.

A hash map uses a special function to jump directly to the location of the key, so it finds values quickly. A list must check each item until it finds the key, which takes longer as the list grows.

❓ Predict Output

intermediate

What is the output of this hash map usage example?

Consider this JavaScript code using a Map to store fruit colors. What will it print?

DSA Javascript

const fruitColors = new Map();
fruitColors.set('apple', 'red');
fruitColors.set('banana', 'yellow');
fruitColors.set('grape', 'purple');
console.log(fruitColors.get('banana'));

A undefined

B "banana"

C "yellow"

D null

💡 Hint

Look at what value is stored with the key 'banana'.

The Map stores 'banana' with the value 'yellow'. The get method returns the value for the key.

❓ Predict Output

advanced

What error occurs when accessing a missing key in a JavaScript object used as a hash map?

What will this code print or error?

DSA Javascript

const map = {a: 1, b: 2};
console.log(map['c'].toString());

A TypeError: Cannot read property 'toString' of undefined

B undefined

C null

D ReferenceError: c is not defined

💡 Hint

What happens if you try to call a method on undefined?

Accessing map['c'] returns undefined because 'c' is not a key. Calling toString() on undefined causes a TypeError.

🧠 Conceptual

advanced

How does a hash map solve the problem of slow search in large data?

When you have thousands of items, searching for one by scanning all items is slow. How does a hash map solve this problem?

A It uses a hash function to convert keys into indexes, allowing direct access without scanning all items.

B It sorts all items alphabetically to speed up search.

C It stores all items in a linked list for faster traversal.

D It duplicates all items to multiple places to find them faster.

💡 Hint

Think about how a hash function helps find the place to look.

A hash map uses a hash function to quickly find the storage location for a key, so it does not need to check every item.

🚀 Application

expert

Which data structure is best for counting word frequencies in a large text?

You want to count how many times each word appears in a large text. Which data structure is best to store and update counts efficiently?

A Stack to push each word and count.

B Hash map (object or Map) to store words as keys and counts as values.

C Linked list to store words and counts sequentially.

D Array to store all words and counts in order.

💡 Hint

Think about fast lookup and update by word.

A hash map allows fast lookup and update of counts by word key, making it ideal for frequency counting.

Practice

1. Why do we use a hash map in programming?
hashMap = {}

easy

A. To store key-value pairs for fast data lookup

B. To store data in a sorted order automatically

C. To perform mathematical calculations faster

D. To create a list of items without duplicates

Solution

1. Step 1: Understand the purpose of a hash map

   A hash map stores data as key-value pairs, allowing quick access to values using keys.

2. Step 2: Compare with other data structures

   Unlike lists or arrays, hash maps provide faster lookup by key, not by position or order.

3. Final Answer:

   To store key-value pairs for fast data lookup -> Option A

4. Quick Check:

   Hash map = fast key-value lookup [OK]

Hint: Hash maps store data by keys for quick access [OK]

Common Mistakes:

• Thinking hash maps sort data automatically
• Confusing hash maps with arrays or lists
• Assuming hash maps are for math calculations

2. Which of the following is the correct way to create an empty hash map (object) in JavaScript?

easy

A. const map = []

B. const map = {}

C. const map = () => {}

D. const map = new Map[]

Solution

1. Step 1: Recall JavaScript syntax for objects

   In JavaScript, curly braces {} create an empty object, which can be used as a hash map.

2. Step 2: Check other options

   Square brackets [] create arrays, () => {} is a function, and new Map[] is invalid syntax.

3. Final Answer:

   const map = {} -> Option B

4. Quick Check:

   Empty object = {} [OK]

Hint: Use curly braces {} to create empty hash maps in JavaScript [OK]

Common Mistakes:

• Using [] which creates an array, not a hash map
• Trying to use function syntax for hash map
• Incorrect new Map[] syntax

3. What will be the output of the following code?

const map = {};
map['apple'] = 5;
map['banana'] = 3;
console.log(map['apple']);

medium

A. 5

B. Error

C. 3

D. undefined

Solution

1. Step 1: Assign values to keys in the hash map

   The code sets map['apple'] = 5 and map['banana'] = 3, storing these key-value pairs.

2. Step 2: Access the value for key 'apple'

   console.log(map['apple']) prints the value 5 stored at key 'apple'.

3. Final Answer:

   5 -> Option A

4. Quick Check:

   map['apple'] = 5, output = 5 [OK]

Hint: Access value by key to get stored number [OK]

Common Mistakes:

• Expecting output to be 'undefined' if key exists
• Confusing values of different keys
• Thinking it causes an error

4. Find the error in this code that tries to use a hash map:

const map = {};
map.apple = 10;
console.log(map['applee']);

medium

A. Syntax error in object creation

B. Using dot notation instead of brackets

C. Cannot assign values to an empty object

D. Accessing a key that does not exist

Solution

1. Step 1: Check key assignment

   map.apple = 10 correctly assigns value 10 to key 'apple'.

2. Step 2: Check key access

   console.log(map['applee']) tries to access key 'applee' which was never assigned, so it returns undefined.

3. Final Answer:

   Accessing a key that does not exist -> Option D

4. Quick Check:

   Wrong key access = undefined [OK]

Hint: Check spelling of keys when accessing hash map values [OK]

Common Mistakes:

• Thinking dot notation is wrong here
• Expecting error on accessing missing key
• Assuming empty object cannot store values

5. You want to count how many times each word appears in an array using a hash map. Which approach correctly solves this problem?

const words = ['cat', 'dog', 'cat', 'bird'];
const counts = {};
// Fill counts here
console.log(counts);

hard

A. for (const w of words) { counts[w] = 1; }

B. for (const w of words) { counts[w] = counts[w] + 1; }

C. for (const w of words) { counts[w] = (counts[w] || 0) + 1; }

D. for (const w of words) { counts[w] += 1; }

Solution

1. Step 1: Understand counting logic

   We need to add 1 to the count for each word. If the word is new, start from 0.

2. Step 2: Analyze each option

   for (const w of words) { counts[w] = 1; } sets count to 1 always, ignoring repeats. for (const w of words) { counts[w] = counts[w] + 1; } tries to add 1 but counts[w] is undefined initially causing NaN. for (const w of words) { counts[w] = (counts[w] || 0) + 1; } uses (counts[w] || 0) + 1 to handle undefined keys correctly. for (const w of words) { counts[w] += 1; } tries to add 1 without initialization, causing NaN.

3. Final Answer:

   for (const w of words) { counts[w] = (counts[w] || 0) + 1; } -> Option C

4. Quick Check:

   Initialize with 0 or use || 0 before adding [OK]

Hint: Use (counts[key] || 0) + 1 to count safely [OK]

Common Mistakes:

• Not initializing counts before adding
• Overwriting counts instead of incrementing
• Assuming counts[w] is always defined