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

Solution: Design HashSet

Explore how to build a custom HashSet class from scratch by implementing effective hashing and collision handling using binary search trees. Understand how to insert, remove, and check keys with efficient time and space complexity, mastering the design of custom data structures.

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