Search⌘ K
AI Features

Solution: Design HashSet

Understand how to design a custom HashSet by implementing a hash function and managing collisions with separate chaining using binary search trees. This lesson guides you through creating various methods like add, remove, and contains with efficient time and space complexity considerations.

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 ...