Why Hash Map Exists and What Problem It Solves in DSA Python - Performance Analysis

Time Complexity: Why Hash Map Exists and What Problem It Solves

O(n) for list search, O(1) average for hash map lookup

Understanding Time Complexity

We want to understand why hash maps are useful by looking at how fast they let us find things.

What problem do hash maps solve when we need to look up data quickly?

Scenario Under Consideration

Analyze the time complexity of searching for a value in a list versus using a hash map.

def find_in_list(lst, target):
    for item in lst:
        if item == target:
            return True
    return False

# Using a hash map (dictionary in Python)
my_map = {"apple": 1, "banana": 2, "cherry": 3}
value = my_map.get("banana")

This code shows two ways to find data: searching a list and looking up a key in a hash map.

Identify Repeating Operations

Look at what repeats when searching.

• Primary operation: Checking each item in the list one by one.
• How many times: Up to all items in the list (n times).
• Hash map lookup: Direct access without repeating checks.

How Execution Grows With Input

As the list gets bigger, searching takes longer because we check more items.

Input Size (n)	Approx. Operations (List Search)	Approx. Operations (Hash Map Lookup)
10	Up to 10 checks	About 1 check
100	Up to 100 checks	About 1 check
1000	Up to 1000 checks	About 1 check

Pattern observation: List search grows linearly with input size, but hash map lookup stays almost constant.

Final Time Complexity

Time Complexity: O(n) for list search, O(1) average for hash map lookup

This means searching a list takes longer as it grows, but hash maps let us find things quickly no matter the size.

Common Mistake

[X] Wrong: "Hash maps always take the same time no matter what."

[OK] Correct: Sometimes hash maps slow down if many items go to the same spot, but usually they are very fast.

Interview Connect

Understanding why hash maps exist helps you explain how to choose the right tool for fast data lookup, a key skill in coding interviews.

Self-Check

"What if we sorted the list first? How would that change the time complexity of searching?"

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. Because lists cannot store multiple values

C. To keep data sorted automatically

D. Because hash maps use less memory than lists

Solution

1. Step 1: Understand list search time

   Searching for a value by key in a list requires checking each item, which takes longer as the list grows.

2. Step 2: Understand hash map lookup

   A hash map uses a key to directly find the value quickly without checking all items.

3. Final Answer:

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

4. Quick Check:

   Hash map lookup is fast key-based access [OK]

Hint: Hash maps speed up key lookups compared to lists [OK]

Common Mistakes:

• Thinking lists cannot store multiple values
• Believing hash maps keep data sorted
• Assuming hash maps always use less memory

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

easy

A. hash_map = set()

B. hash_map = []

C. hash_map = ()

D. hash_map = {}

Solution

1. Step 1: Recall Python data types

   Lists use [], tuples use (), sets use set(), and dictionaries (hash maps) use {}.

2. Step 2: Identify dictionary syntax

   Empty dictionary is created with curly braces {}.

3. Final Answer:

   hash_map = {} -> Option D

4. Quick Check:

   Empty dict uses curly braces {} [OK]

Hint: Use curly braces {} to create empty dictionary [OK]

Common Mistakes:

• Using [] which creates a list
• Using () which creates a tuple
• Using set() which creates a set

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

hash_map = {}
hash_map['apple'] = 5
hash_map['banana'] = 3
print(hash_map['apple'])

medium

A. 3

B. 5

C. apple

D. KeyError

Solution

1. Step 1: Add key-value pairs to hash map

   We add 'apple' with value 5 and 'banana' with value 3 to the dictionary.

2. Step 2: Access value by key 'apple'

   Printing hash_map['apple'] returns the value 5 stored for key 'apple'.

3. Final Answer:

   5 -> Option B

4. Quick Check:

   Value for 'apple' is 5 [OK]

Hint: Access dictionary values by keys with hash_map[key] [OK]

Common Mistakes:

• Confusing keys and values
• Expecting output to be the key
• Thinking it raises KeyError

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

words = ['cat', 'dog', 'cat']
counts = {}
for word in words:
    counts[word] = counts[word] + 1
print(counts)

medium

A. Incorrect loop syntax

B. Using list instead of dictionary

C. Missing initialization for counts[word] before adding 1

D. Print statement syntax error

Solution

1. Step 1: Understand the loop logic

   The code tries to add 1 to counts[word], but counts[word] does not exist initially.

2. Step 2: Identify missing initialization

   Before adding 1, counts[word] must be set to 0 if the key is new, otherwise it causes a KeyError.

3. Final Answer:

   Missing initialization for counts[word] before adding 1 -> Option C

4. Quick Check:

   Initialize counts[word] before incrementing [OK]

Hint: Initialize dictionary keys before incrementing values [OK]

Common Mistakes:

• Assuming keys auto-initialize to zero
• Thinking loop syntax is wrong
• Believing print statement causes error

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

hard

A. Use a hash map to store counts, initialize missing keys to 0, then increment for each character

B. Use a list to store counts and search for characters each time

C. Use a hash map but only add keys after counting all characters

D. Use a tuple to store counts since tuples are immutable

Solution

1. Step 1: Understand counting with hash map

   We need to track counts for each character as we see them, so we update counts on the fly.

2. Step 2: Identify correct method

   Initializing missing keys to 0 before incrementing ensures accurate counting without errors.

3. Step 3: Eliminate incorrect options

   Lists require searching each time (slow), adding keys after counting is impossible, tuples cannot be changed.

4. Final Answer:

   Use a hash map to store counts, initialize missing keys to 0, then increment for each character -> Option A

5. Quick Check:

   Initialize and increment counts in hash map [OK]

Hint: Initialize counts to zero before incrementing in hash map [OK]

Common Mistakes:

• Using lists causing slow lookups
• Trying to add keys after counting
• Using immutable tuples for counts