Design HashMap · Coding Interview Practice

Design HashMapDesign a HashMap without using built-in hash table libraries, supporting put, get, and remove.Constraints

0 <= key, value <= 10^6

At most 10^4 calls are made

Examples

Input: put(1,1), put(2,2), get(1) Output: 1

Input: remove(2), get(2) Output: -1

LetsDiscuss

Loading your session…