Company: High radius_6aug
Difficulty: medium
Custom HashMap Problem Description In this problem, you are tasked with implementing a simplified associative array, commonly known as a hash map. Your implementation will store key-value pairs, where keys are strings and values are 64-bit integers. You must support three operations: PUT key value — Insert a pair (key, value) into the map. If the key already exists, its associated value should be updated to the new value. This operation should not produce any output. GET key — Retrieve the value associated with the given key. If the key exists, print its value. Otherwise, print the string null . REMOVE key — Remove the entry for the given key. If the key existed, print the value that was removed. Otherwise, print the string null . Constraints Your implementation must adhere to the following specific technical requirements: Hashing: You must implement your own hashing function for string keys. You are not allowed to use any built-in hashing functions or library map implementations (e.g.