Requirement:

Use open addressing to resolve hash collision.

You may choose any open addressing techniques (e.g. linear probing etc)

Do not use built-in dict class in Python

O(1) time complexity for both contains, get, put, remove methods

Remark:

Note that the provided hash function takes str as input

The key of hashmap can be any type. However, in this exercise, it is safe to assume it is str or int.

Hints:

linear probing is probably the easiest method

The trickest part is the remove function.

You need to do table doubling as the load factor greater than 0.5.