Design HashMap Implementation Problem

Design HashMap Implementation Problem — ExecCode Easy DSA Practice

Solve the Design HashMap Implementation problem on ExecCode. Free online easy DSA practice in Design. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the input needed to solve Design HashMap Implementation. Your task is to compute the required answer and return get results only, one per line. data: operations as in samples.

Examples

Input {"data": "3\nput 1 1\nget 1\nremove 1"}; Output 1. Input {"data": "5\nput 1 1\nput 2 2\nget 1\nremove 2\nget 2"}; Output 1 -1. Input {"data": "4\nput 1 1\nput 1 2\nget 1\nremove 1"}; Output 2

Constraints

Operations <= 10^4

Practice Design HashMap Implementation free on ExecCode. Browse DSA problems, topic map, and placement guides.