Implement an Integer Hash Map

Q: Implement an Integer Hash Map

This question evaluates understanding of hashing principles, collision handling, and data structure design for integer key-value storage, testing algorithmic complexity and API correctness within the Coding & Algorithms domain.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Design a data structure MyHashMap that stores integer keys and integer values without using any built-in hash table library.

Implement the following operations:

put(key, value) : Insert the key-value pair into the map. If the key already exists, update its value.
get(key) : Return the value associated with the key. If the key does not exist, return -1 .
remove(key) : Remove the key and its value if the key exists.

Requirements:

Keys and values are non-negative integers.
The implementation should support repeated updates to the same key.
Each operation should be efficient on average.
Do not use built-in map, dictionary, or hash table implementations.

Example:

put(1, 10)
put(2, 20)
get(1) returns 10
get(3) returns -1
put(2, 30)
get(2) returns 30
remove(2)
get(2) returns -1

Implement an Integer Hash Map

Quick Overview

Comments (0)