Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Design HashMap

Explore how to design a HashMap that supports insertion, retrieval, and deletion of key-value pairs without built-in libraries. Understand designing an effective hash function using prime number modulo, managing collisions through buckets, and implementing core operations like put, get, and remove. This lesson helps you build a foundational data structure useful for coding interviews and real-world applications.

We'll cover the following...

Statement

Design a HashMap data structure that supports the following operations:

  • Constructor(): Initializes the hash map object with an empty map to store the key-value pairs.

  • Put(key, value): Inserts a key-value pair into the hash map. If the specified key is already present in the hash map, the associated value is updated. Otherwise, the key-value pair is added to the hash map.

  • Get(key): Returns the value associated with the specified key if the key exists in the hash map. Otherwise, it returns −1-1, indicating the absence of a mapping for the key.

  • Remove(key): Removes the entry for the specified key from the hash map, effectively removing both the key and its associated value. This elimination only takes place when the key exists in the hash map.

Note: Your implementation should not utilize the built-in hash table libraries.

Constraints:

  • 00 ≤\le key ≤\le 10610^6
...