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

Solution: Design HashSet

Explore how to design a custom MyHashSet class in Go by implementing a hash function and using binary search trees for collision handling. Learn to create efficient add, remove, and contains methods while managing time and space complexity, enhancing your understanding of data structures for coding interviews.

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