Design HashSet

Try to solve the Design HashSet problem.

We'll cover the following

Statement

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:

  • 00 ≤\leq key ≤106\leq 10^6

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

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.