Design a MyHashSet class without using any built-in hash table libraries and implement the following methods in it:

• void add(key): Inserts the value key into the HashSet.

• bool contains(key): Returns TRUE if the key exists in the HashSet, FALSE otherwise.

• void remove(key): Removes the value key if it exists in the HashSet.

Constraints:

• $0$ $\leq$ key $\leq 10^6$

• At most, $10^4$ calls will be made to add, contains, and remove methods.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground: