LIMEROAD Hiring On-Campus OA (2022)| Problem Design HashMap Without Built-in Hash Table Libraries

Problem Statement Design and implement a HashMap data structure without using any built-in hash table libraries. The HashMap should support the following operations: put(key, value) Insert a (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 mapping for the specified key if it exists. All keys and values are non-negative integers. Implement the MyHashMap class with ...