Solution: Design HashSet
Explore the design of a custom HashSet class without built-in libraries by implementing core methods like add, remove, and contains. Understand how to use a prime-sized bucket array with a hash function for even key distribution and apply binary search trees for collision handling. This lesson helps you grasp the underlying algorithms and data structure tradeoffs to efficiently manage large key sets.
We'll cover the following...
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 valuekeyinto the HashSet.bool contains(key): Returns TRUE if thekeyexists in the HashSet, FALSE otherwise.void remove(key): Removes the valuekeyif it exists in the HashSet.
Constraints:
key...