Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Design HashSet

Explore how to design a custom MyHashSet supporting add, remove, and contains operations efficiently without using built-in hash tables. Understand the implementation of a hash function, separate chaining with binary search trees for collision resolution, and analyze the time and space complexity of the solution.

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