Design HashSet | Full Details | GOOGLE | Leetcode-705 | Live Code

This is the 7th Video of our Design Data Structure Playlist.
In this video we will try to solve a very easy problem "Design HashSet" (Leetcode - 705).

Share your learnings on LinkedIn, Twitter (X), Instagram, Facebook(Meta) with #codestorywithmik & feel free to tag me.

Problem Name : Design HashSet
Company Tags : Google

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish

[sunnyvlogs__]

Hashing Class Done 🔥🔥
Bhaiya maine LinkedList se implement Kiya tha.

[wearevacationuncoverers]

There is QUALITY in every video of yours. Even if it's an easy problem. I never regret watching your videos.

[rahulmaurya]

As always, , your videos are always INFORMATIVE, , Your unconditional love towards us, , is Unmatchable 🙏

[rahulmaurya]

Doubt* BRUTE FORCE :: Bhaiya agr hm constructor me vector ko resize ni krke sidhe "vector<bool> v (10000, false) ; " krein toh error kyu throw krta hai ??

[honey]

Please arrange all leetcode questions o
In one Playlist my many difficulty face to find q? If you can do that is best for us

[--Blood--Prince--]

Sir why auto iterator? ...will int iterator not work??
25:24

[molyoxide]

Bro aapne itna deep mein kaha se seekha tha??

[AnkitSingh-tmdp]

Very informative and interesting vedio 👏👏🎉

[honey]

Tag validator leetcode ke Kara do bhaiya

[souravjoshi]

so much knowledge from just one video 🔥🔥

[rahulrathaur]

Just Amazed by your explaination ❤❤. Finally I got my the best Youtube content

[yuvhrajverma]

Sir I liked ur hashing explanation can u provide some resources on yt or any other resources where I can learn this in depth

[yuvhrajverma]

Sir can u please share the resources to learn about rolling hash 😅

[AlishaKhan-wwio]

The only Channel I trust to get best solution ❤

[vineetkumarmotwani]

For reference :

std::vector : Contiguous memory. std::list : Non-contiguous memory.

Vector : Pre-allocates space for future elements, so extra space required beyond what's necessary for the elements themselves. List : No pre-allocated memory. The memory overhead for the list itself is constant.

Vector : Each element only requires the space for the element type itself (no extra pointers). List : Each element requires extra space for the node which holds the element, including pointers to the next and previous elements in the list.

Vector : Erasures at the end of the vector are constant time, but for the rest it's O(n). List : It's cheap to combine lists with splicing.

Vector : Iterators are invalidated if you add or remove elements to or from the vector. List : Iterators remain valid even when you add or remove elements from the list.

Overall, it depends on your requirements. If the hashmap is update-heavy, it is better to use vector of lists, while if the hashmap is pretty much pre-defined and fixated, it is better to use vector of vectors to get the values.