Design a Basic Hash Map

Problem

Process put, get and remove operations. Return the results of get operations; return -1 for missing keys.

Examples

Example 1

Input: {"operations":[["put",1,10],["put",2,20],["get",1],["remove",1],["get",1]]}

Output: [10,-1]

Example 2

Input: {"operations":[["get",2],["put",2,7],["get",2]]}

Output: [-1,7]

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Design a Basic Hash Map

Process put, get and remove operations. Return the results of get operations; return -1 for missing keys. Think about key-value storage and the behaviour of missing keys. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(1) average time per operation with a hash table.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.