Design HashSet | Leetcode - 705

preview_player
Показать описание
The day 2 problem in August Leetcoding Challenge. ( Design HashSet ).

Check out our other popular playlists:

0:00 How to design a HashSet?
0:40 What is hash Function and collision handling?
0:57 Strategies to resolve hash conflicts
1:32 What is Seperate Chaining?
2:01 Linked List as Bucket
4:39 Drawbacks of Linked List
4:50 How we can optimize it?

Problem statement:
Design a HashSet without using any built-in hash table libraries.

To be specific, your design should include these functions:

add(value): Insert a value into the HashSet.
contains(value) : Return whether the value exists in the HashSet or not.
remove(value): Remove a value in the HashSet. If the value does not exist in the HashSet, do nothing.

Example:

MyHashSet hashSet = new MyHashSet();

Note:

All values will be in the range of [0, 1000000].
The number of operations will be in the range of [1, 10000].
Please do not use the built-in HashSet library.

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #interview #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
Рекомендации по теме
Комментарии
Автор

We hope you all are enjoying the August leetcoding challenge!!! Don't forget to leave a comment!!! Please like the video to support us!!!
Questions you might like:
Struggling in a question??
Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
visit shbcf.ru