HashMap Implementation from Scratch in DSA Python - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to initialize the hash map with empty buckets.

DSA Python

class HashMap:
    def __init__(self, size=10):
        self.size = size
        self.buckets = [1]

Drag options to blanks, or click blank then click option'

A[0] * self.size

Blist(range(self.size))

C{}

D[[] for _ in range(self.size)]

Attempts:

3 left

💡 Hint

Common Mistakes

Using a list of zeros instead of empty lists.

Using a dictionary instead of a list of buckets.

We create a list of empty lists, one for each bucket, to store key-value pairs.

2fill in blank

medium

Complete the code to compute the bucket index using the built-in hash function.

DSA Python

def _get_bucket_index(self, key):
    return [1] % self.size

Drag options to blanks, or click blank then click option'

Akey

Bhash(key)

Clen(key)

Dkey % self.size

Attempts:

3 left

💡 Hint

Common Mistakes

Using the key directly without hashing.

Using length of key which is not unique.

We use the built-in hash function to get a hash value for the key, then mod by size to find the bucket.

3fill in blank

hard

Fix the error in the put method to update the value if the key already exists.

DSA Python

def put(self, key, value):
    index = self._get_bucket_index(key)
    bucket = self.buckets[index]
    for i, (k, v) in enumerate(bucket):
        if k == key:
            bucket[i] = (key, [1])
            return
    bucket.append((key, value))

Drag options to blanks, or click blank then click option'

Av

Bkey

Cvalue

Dindex

Attempts:

3 left

💡 Hint

Common Mistakes

Using the old value instead of the new one.

Using the key or index instead of value.

We replace the old value with the new value for the existing key.

4fill in blank

hard

Fill both blanks to complete the get method that returns the value or None if key not found.

DSA Python

def get(self, key):
    index = self._get_bucket_index(key)
    bucket = self.buckets[index]
    for k, v in bucket:
        if k [1] key:
            return [2]
    return None

Drag options to blanks, or click blank then click option'

A==

B!=

Cv

Dk

Attempts:

3 left

💡 Hint

Common Mistakes

Using '!=' instead of '=='.

Returning the key instead of the value.

We check if the key matches and return the corresponding value.

5fill in blank

hard

Fill both blanks to complete the remove method that deletes a key-value pair if it exists.

DSA Python

def remove(self, key):
    index = self._get_bucket_index(key)
    bucket = self.bucketsindex]
    for i, (k, v) in enumerate(bucket):
        if k [1] key:
            [2] bucket[i
            return True
    return False

Drag options to blanks, or click blank then click option'

A==

Bdel

C[

D!=

Attempts:

3 left

💡 Hint

Common Mistakes

Using '!=' instead of '=='.

Using remove() method instead of del with index.

Forgetting to use brackets for indexing.

We check if keys match, then delete the item at index i from the bucket list.

Practice

1. What is the main purpose of a HashMap in data structures?

easy

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

B. To store data in a sorted order

C. To perform mathematical calculations

D. To store data in a sequential list

Solution

1. Step 1: Understand what a HashMap stores

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

2. Step 2: Identify the main purpose

   The main purpose is to retrieve data quickly by keys, not to sort or calculate.

3. Final Answer:

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

4. Quick Check:

   HashMap = fast key-value access [OK]

Hint: Remember: HashMap = key-value pairs for quick lookup [OK]

Common Mistakes:

• Confusing HashMap with sorted data structures
• Thinking HashMap stores data sequentially
• Assuming HashMap is for calculations

2. Which of the following is the correct way to define a simple HashMap class constructor in Python?

easy

A. def __init__(self): self.map = set()

B. def __init__(self): self.map = []

C. def __init__(self): self.map = {}

D. def __init__(self): self.map = ()

Solution

1. Step 1: Identify the data structure for storing key-value pairs

   A HashMap stores key-value pairs, so a dictionary {} is appropriate.

2. Step 2: Check each option's data type

   def __init__(self): self.map = {} uses {} which is a dictionary. Others use list, set, or tuple which are not suitable for key-value mapping.

3. Final Answer:

   def __init__(self): self.map = {} -> Option C

4. Quick Check:

   HashMap uses dictionary = {} [OK]

Hint: Use {} to store key-value pairs in Python [OK]

Common Mistakes:

• Using list or tuple instead of dictionary
• Confusing set with dictionary
• Not initializing the map attribute

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

class HashMap:
    def __init__(self):
        self.map = {}
    def put(self, key, value):
        self.map[key] = value
    def get(self, key):
        return self.map.get(key, None)

h = HashMap()
h.put('a', 1)
h.put('b', 2)
print(h.get('a'))
print(h.get('c'))

medium

A. 1\nNone

B. 1\n0

C. None\nNone

D. Error

Solution

1. Step 1: Trace the put method calls

   Keys 'a' and 'b' are added with values 1 and 2 respectively.

2. Step 2: Trace the get method calls

   Getting 'a' returns 1. Getting 'c' returns None because 'c' is not in the map and default is None.

3. Final Answer:

   1\nNone -> Option A

4. Quick Check:

   Existing key returns value, missing key returns None [OK]

Hint: get() returns None if key not found by default [OK]

Common Mistakes:

• Expecting 0 instead of None for missing keys
• Confusing print output format
• Assuming error on missing key

4. Find the error in this HashMap implementation snippet:

class HashMap:
    def __init__(self):
        self.map = []
    def put(self, key, value):
        self.map[key] = value

medium

A. Missing return statement in put method

B. No error, code is correct

C. Incorrect method name put instead of add

D. Using list instead of dictionary for self.map

Solution

1. Step 1: Check the data structure used for self.map

   self.map is initialized as a list, but lists do not support key-based assignment.

2. Step 2: Understand why list causes error

   Using self.map[key] = value will cause TypeError because list indices must be integers, not keys.

3. Final Answer:

   Using list instead of dictionary for self.map -> Option D

4. Quick Check:

   List can't use keys as indices [OK]

Hint: Use dictionary {} for key-value storage, not list [] [OK]

Common Mistakes:

• Thinking put method needs return
• Confusing method names
• Ignoring data type of self.map

5. You want to implement a HashMap that handles collisions by chaining (using lists). Which of the following code snippets correctly initializes the internal storage for chaining?

hard

A. self.map = {}

B. self.map = [[] for _ in range(size)]

C. self.map = [None] * size

D. self.map = [0] * size

Solution

1. Step 1: Understand chaining collision handling

   Chaining uses a list of lists where each bucket holds a list of key-value pairs.

2. Step 2: Identify correct initialization

   self.map = [[] for _ in range(size)] creates a list of empty lists, one for each bucket, suitable for chaining.

3. Step 3: Why other options are incorrect

   self.map = [None] * size creates a list of None, which needs extra checks. self.map = {} is a dictionary, not a list of buckets. self.map = [0] * size creates a list of zeros, not suitable for chaining.

4. Final Answer:

   self.map = [[] for _ in range(size)] -> Option B

5. Quick Check:

   Chaining needs list of lists = [[] for _ in range(size)] [OK]

Hint: Use list comprehension to create buckets for chaining [OK]

Common Mistakes:

• Using None or 0 instead of empty lists for buckets
• Confusing dictionary with list of buckets
• Not initializing buckets properly for chaining