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

Solution: Design HashSet

Understand how to design a HashSet in Go without built-in libraries by implementing a custom hash function and handling collisions with separate chaining via binary search trees. Learn to add, remove, and check for keys efficiently while considering time and space complexity.

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