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

Solution: Design HashSet

Understand how to design a custom HashSet in Go without built-in libraries by implementing a hash function and using separate chaining with binary search trees to manage collisions. This lesson explains bucket initialization, insertion, deletion, and search operations, along with their time and space complexity tradeoffs.

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