Design a HashSet

Create a HashSet data structure without using any built-in hash table libraries.

Functions Description:

1) Constructor: Initializes the data members as required.

2) add(value): Inserts an element into the HashSet. Takes one argument, the value to be added, and returns nothing.

3) contains(value): Checks if the element exists in the HashSet. Takes one argument, the value to be searched for. Returns true if the element exists, otherwise returns false.

4) remove(value): Removes an element from the HashSet. Takes one argument, the value to be removed. Returns the removed element, or -1 if the element does not exist or the HashSet is empty.

Query Operations:

Query-1 (1): Inserts an element into the HashSet.
Query-2 (2): Returns a boolean indicating whether the element is present.
Query-3 (3): Removes the element from the HashSet.

Input:

The first line contains an integer ‘Q’, the number of queries.
Each of the next ‘Q’ lines contains two integers, representing the type of operation and the value.

Output:

For Query-1: Do not return anything.
For Query-2: Return true or false based on the presence of the element.
For Query-3: Return the element being removed, or -1 if not present.

Constraints:

• 1 <= Q <= 10³
• 1 <= query type <= 3
• 0 <= VALUE <= 10⁶
• Time limit: 1 second