Design HashSet | Leet code 705 | Theory explained + Python code | August Leet code challenge

This video is a solution to Leet code 705, Design HashSet. I first explain what a Hash set is and how we could solve this question then I implement the solution using Python code.

Comment below if you have a better solution to this problem!

Let me know if you have any feedback and don't forget to subscribe for more videos!

More leetcode questions solved:

Gear used:

[aditisurvase]

I believe sets shouldn't have elements repeating, those checks have not been done while inserting.

[abdifatahmoh]

Wow, nothing can be compared to your explanation, really helpful. Thank you!

[rockmanvnx]

For your add you need to check if it contains. What if we add duplicate values

[smart]

I thought, if you already have 2 in the set, adding another 2 will ignore it. but this algorithm will add another 2 anyway.

[kylehammerberg]

Great explanation, man. Simple and straightforward.

[praneeth]

Awesome buddy... Keep up your good job.. You are educating so many people...

[buildwithcarolina]

Wonderful explanation! You are literally the best!!!

[yhgong]

thank u so much, it really helped a lot

[jeevansch.]

Awesome video bro, well explained, because of you today i learned something.

[lingyuhu]

Easy to understand, thank you. But I'm just wondering that the hashset should be with unique elelment?

[yunaf]

Amazing explanation, thanks for this :)

[ogoubah]

Really understood the concept, thanks!

[pythonenthusiast]

Shouldnt you initialize your table as something like [ [ None ] for i in range(self.size) ] as you are appending incase of a collision because the individual elements are not of class list? what do you think?

[tl]

Great vid! However, none of these functions actually give O(1) time complexity like a built-in hashset. Do you have any other alternatives?