Why Hash Map Exists and What Problem It Solves in DSA C - Why It Works

Concept Flow - Why Hash Map Exists and What Problem It Solves

Start: Need to store key-value pairs

↓

Use simple list/array?

↓

Problem: Slow search (linear scan)

↓

Idea: Use hash function to map key to index

↓

Store value at computed index

↓

Handle collisions if two keys map to same index

↓

Fast search, insert, delete by key

↓

End: Efficient key-value storage

Shows the flow from needing to store key-value pairs, facing slow search with simple lists, to using hashing for fast access.

Execution Sample

DSA C

Insert key 'apple' with value 5
Insert key 'banana' with value 3
Search key 'apple'
Delete key 'banana'

Demonstrates inserting, searching, and deleting keys in a hash map using hashing.

Execution Table

Step	Operation	Hash Index	Collision?	Action	Hash Map State
1	Insert 'apple' with 5	hash('apple')=2	No	Store at index 2	[null, null, ('apple',5), null, null]
2	Insert 'banana' with 3	hash('banana')=4	No	Store at index 4	[null, null, ('apple',5), null, ('banana',3)]
3	Search 'apple'	hash('apple')=2	No	Found ('apple',5)	[null, null, ('apple',5), null, ('banana',3)]
4	Delete 'banana'	hash('banana')=4	No	Remove from index 4	[null, null, ('apple',5), null, null]
5	Search 'banana'	hash('banana')=4	No	Not found	[null, null, ('apple',5), null, null]

💡 Operations complete; hash map shows fast access by key using hash indices.

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	After Step 4	After Step 5
Hash Map Array	[null, null, null, null, null]	[null, null, ('apple',5), null, null]	[null, null, ('apple',5), null, ('banana',3)]	[null, null, ('apple',5), null, ('banana',3)]	[null, null, ('apple',5), null, null]	[null, null, ('apple',5), null, null]
Search Result	N/A	N/A	N/A	('apple',5)	N/A	Not found

Key Moments - 3 Insights

Why can't we just use a simple list to store key-value pairs?

Because searching for a key in a simple list requires checking each element one by one, which is slow as shown in the concept flow before hashing is introduced.

What happens if two different keys produce the same hash index?

This is called a collision. The hash map must handle collisions (not shown in this simple example) to store both keys without losing data.

Why is the hash function important?

The hash function quickly converts a key into an index, allowing fast access to the value without scanning the whole list, as seen in the execution table steps.

Visual Quiz - 3 Questions

Look at the execution table, what is stored at index 2 after step 2?

A ('banana', 3)

B ('apple', 5)

C null

D ('apple', 3)

💡 Hint

Check the 'Hash Map State' column after step 2 in the execution table.

At which step is the key 'banana' removed from the hash map?

A Step 4

B Step 3

C Step 5

D Step 2

💡 Hint

Look at the 'Operation' and 'Action' columns in the execution table.

If the hash function for 'banana' returned index 2 instead of 4, what would happen?

A No change, 'banana' stored at index 4

B 'banana' replaces 'apple' at index 2

C Collision occurs at index 2, requiring collision handling

D 'banana' stored at index 3

💡 Hint

Refer to the key moment about collisions and the execution table showing hash indices.

Concept Snapshot

Hash Map stores key-value pairs using a hash function.
Hash function converts keys to array indices.
Allows fast insert, search, delete by key.
Handles collisions when indices clash.
Solves slow search problem of simple lists.

Full Transcript

A hash map is a data structure that stores key-value pairs efficiently. Without it, searching keys in a simple list is slow because you must check each item. The hash map uses a hash function to convert keys into array indices, allowing quick access. When inserting, the value is stored at the computed index. Searching uses the same hash to find the value fast. Deletion removes the value from the index. Collisions happen if two keys map to the same index, which requires special handling. This example shows inserting 'apple' and 'banana', searching 'apple', deleting 'banana', and searching 'banana' again, demonstrating fast operations using hashing.

Practice

1. Why do we use a hash map instead of a simple list to store key-value pairs?

easy

A. To quickly find values using keys without searching the entire list

B. To store values in sorted order automatically

C. To save memory by compressing data

D. To allow duplicate keys with different values

Solution

1. Step 1: Understand list search time

   In a simple list, finding a value by key requires checking each item one by one, which takes longer as the list grows.

2. Step 2: Understand hash map lookup

   A hash map uses a special function to jump directly to the value's location, making search very fast regardless of size.

3. Final Answer:

   To quickly find values using keys without searching the entire list -> Option A

4. Quick Check:

   Hash map = fast key lookup [OK]

Hint: Hash maps speed up key-based searches [OK]

Common Mistakes:

• Thinking hash maps store data sorted automatically
• Believing hash maps compress data to save memory
• Assuming hash maps allow duplicate keys

2. Which of the following is the correct syntax to declare a hash map in C using a struct and array?

easy

A. struct HashMap { int key; int value; } map[100];

B. HashMap map = new HashMap();

C. hash_map map;

D. map = {};

Solution

1. Step 1: Recognize C syntax for struct arrays

   In C, a hash map can be represented as an array of structs with key and value fields.

2. Step 2: Check options for valid C declaration

   struct HashMap { int key; int value; } map[100]; correctly declares a struct and an array of 100 elements. Other options use syntax from other languages or invalid C syntax.

3. Final Answer:

   struct HashMap { int key; int value; } map[100]; -> Option A

4. Quick Check:

   C struct array = struct HashMap { int key; int value; } map[100]; [OK]

Hint: C uses structs and arrays for hash maps [OK]

Common Mistakes:

• Using C++ or Java syntax in C code
• Trying to declare hash maps without structs
• Using empty braces {} for initialization

3. Consider this simplified hash map code in C that stores keys and values:

struct Entry { int key; int value; };
struct Entry map[5] = {{1, 10}, {2, 20}, {3, 30}, {4, 40}, {5, 50}};

int findValue(int key) {
  for (int i = 0; i < 5; i++) {
    if (map[i].key == key) return map[i].value;
  }
  return -1;
}

int main() {
  printf("%d", findValue(3));
  return 0;
}

What is the output when this program runs?

medium

A. 3

B. -1

C. 30

D. Compilation error

Solution

1. Step 1: Understand the findValue function

   The function loops through the map array and returns the value where the key matches the input.

2. Step 2: Trace the call findValue(3)

   It finds key 3 at index 2 with value 30 and returns it. So printf prints 30.

3. Final Answer:

   30 -> Option C

4. Quick Check:

   Key 3 value = 30 [OK]

Hint: Loop finds key, returns matching value [OK]

Common Mistakes:

• Confusing key with value in output
• Assuming function returns key instead of value
• Expecting compilation error due to struct

4. This code tries to find a value by key in a hash map but has a bug:

struct Entry { int key; int value; };
struct Entry map[3] = {{1, 100}, {2, 200}, {3, 300}};

int findValue(int key) {
  for (int i = 0; i <= 3; i++) {
    if (map[i].key == key) return map[i].value;
  }
  return -1;
}

What is the bug and how to fix it?

medium

A. The key comparison uses '==' instead of '='; replace '==' with '='

B. The struct is missing a constructor; add one to fix it

C. The return type should be void; change int to void

D. The loop goes out of bounds; change 'i <= 3' to 'i < 3' to fix it

Solution

1. Step 1: Check loop bounds

   The array has 3 elements indexed 0,1,2. Loop with 'i <= 3' accesses map[3], which is out of bounds.

2. Step 2: Fix loop condition

   Change loop to 'i < 3' to stay within valid indices and avoid runtime errors.

3. Final Answer:

   The loop goes out of bounds; change 'i <= 3' to 'i < 3' to fix it -> Option D

4. Quick Check:

   Loop bounds must match array size [OK]

Hint: Array index must be less than size, not less or equal [OK]

Common Mistakes:

• Ignoring array bounds causing crashes
• Confusing assignment '=' with comparison '=='
• Changing return type unnecessarily

5. You want to store student IDs and their grades using a hash map in C. Which problem does using a hash map solve best compared to an array or list? A student ID is a large number and not continuous. Options: A) Allow multiple students to share the same ID B) Automatically sort students by their grades C) Save memory by storing only unique grades D) Quickly find a student's grade by their ID without searching all entries

hard

A. Allow multiple students to share the same ID

B. Quickly find a student's grade by their ID without searching all entries

C. Save memory by storing only unique grades

D. Automatically sort students by their grades

Solution

1. Step 1: Understand the problem with large, non-continuous keys

   Arrays or lists require searching or large memory if keys are large and sparse.

2. Step 2: How hash maps help

   Hash maps use a function to map large keys to storage locations, enabling fast lookup without scanning all data.

3. Final Answer:

   Quickly find a student's grade by their ID without searching all entries -> Option B

4. Quick Check:

   Hash map = fast lookup for large keys [OK]

Hint: Hash maps handle large keys efficiently [OK]

Common Mistakes:

• Thinking hash maps sort data automatically
• Believing hash maps compress data to save memory
• Assuming duplicate keys are allowed