Company: High radius_6aug
Difficulty: medium
Custom HashMap Problem Description Implement a simplified associative array, commonly known as a hash map. The map stores key-value pairs, where every key is a string and every value is a 64-bit integer. It must support three operations: PUT key value -- Insert the pair (key, value) into the map. If key is already present, replace its value with the new value . This operation prints nothing. GET key -- If key is present, print its value. Otherwise, print null . REMOVE key -- If key is present, delete it from the map and print the value it had. Otherwise, print null . Complete the three methods put , get and remove of the Solution class. The map must be built by hand, following these requirements: Hashing: Write your own hash function for string keys. Do not use built-in hash functions or library map implementations (for example java.util.HashMap , std::unordered_map or a Python dict ). Collision handling: Resolve collisions by separate chaining : each slot of the underlying array is a