Design HashSet | LeetCode 705 | C++, Java, Python

preview_player
Показать описание

**** Best Books For Data Structures & Algorithms for Interviews:**********
*****************************************************************************

August LeetCoding Challenge | Problem 2 | Design HashSet | 2 August,
Facebook Coding Interview question,
google coding interview question,
leetcode,
Design HashSet,
Design HashSet c++,
Design HashSet Java,
Design HashSet python,
Design HashSet solution,
705. Design HashSet,

#CodingInterview #LeetCode #AugustLeetCodingChallenge #Google #Amazon #HashSet
Рекомендации по теме
Комментарии
Автор

Thoroughly explained, all the underlying concepts were briefed as well.👍
Appreciate the effort.

abhinav_
Автор

High Effort content thats all we need
Thanks I finally got it!

anime__ash
Автор

Thank you much for taking the time to make all the videos! Much appreciated sir! <3

janmichaelaustria
Автор

You teach really well. I only have one question - you mentioned separate chaining to address collision issue so I think the codes incorporate this. I'm looking at Python codes. If you do add or remove a key, you search for bucket i. Does this search mean chained keys, if any, at the same bucket are also searched? Thank you.

waiyanleung
Автор

Love your videos as usual. Your videos became my daily routine. If you have some time left please do and explain leetcode 230 along with follow up questions.

ayyappahemanth
Автор

sir can u make a series of interview preparation it will help a lot!!

namangoyal
Автор

Thank You So Much...Nice and Simple explanation !!

abhishekchaurasia
Автор

best explanation and moreover got to know more about hashing

siddharthsingh
Автор

can you explain the initialisation of vector in the myhashset constructor ? great explaination by the way.

vinoltauro
Автор

Sir under which CS topics do we study about about Hashing and separate chaining and open addressing.? In which book can i find about these ?

genghisda
Автор

one thing i don't understand is why you take 15000 as numbuckets ??

rohangangwar
Автор

What happens if I make the hash_function() public?

maheiramkhan
Автор

Sir for recording of video which software you are using

myaseen
Автор

What if all the keys are mutiple of 5? Then, all the keys will go into a single bucket. The complexities will be O(n) then.

bhawansingla
Автор

Sir will you consider making more videos of the Rust programming series ?

debarghyachakraborty
Автор

Nice explanation. But why you have chosen numbuckets =15000? why not some other number? could you explain the way to choose optimal value for numBuckets?

DevMaster
Автор

i dont know why i feel i had seen "design hash map " video on this channel, now i cannot find it, , is it deleted ?

genghisda
Автор

What software do you use to write on the screen?

alxx
Автор

I didnt get why used num buckets = 15000 could you please explain

kollivenkatamadhukar
Автор

Just a "funny" solution (don't take seriously):

class MyHashSet {

boolean[] array;

public MyHashSet() {
array = new
}

public void add(int key) {
array[key] = true;
}

public void remove(int key) {
array[key] = false;
}

public boolean contains(int key) {
return array[key];
}
}

Lol

cloud
welcome to shbcf.ru