Design a Hash Map

What You'll Build

• The HashMap must support put(key, value) operation that inserts a new key-value pair or updates the value if the key already exists. This operation should handle hash collisions appropriately.
• The HashMap must support get(key) operation that returns the value associated with the key if it exists, or -1 if the key is not found.
• The HashMap must support remove(key) operation that deletes the key-value pair associated with the given key if it exists.
• The HashMap must handle hash collisions using separate chaining, where each bucket contains a linked list of entries that hash to the same index.
• The HashMap must dynamically resize when the load factor (number of entries / bucket capacity) exceeds a threshold of 0.75, doubling the bucket capacity and rehashing all existing entries.
• ...and more