Solution: Design HashMap

Explore how to design a HashMap data structure by implementing key operations such as put, get, and remove. Understand the importance of a good hash function using a prime modulo to minimize collisions and learn to handle collisions effectively using buckets. This lesson guides you through building a HashMap from scratch, emphasizing data storage, retrieval, and deletion methods while managing time and space complexity.

We'll cover the following...

Statement
Solution

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$ , 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:

$0$ $\le$ key $\le$ $10^6$

...