Design HashMap | Brute Force | Optimal | META | GOOGLE | NETFLIX | Leetcode - 706

[@codestorywithMIK]

DESIGN HASHSET VIDEO - kzbin.info/www/bejne/iqSce3t7lqajnK8 I have explained about Load Factor, Chaining, Probing in that.

[@wearevacationuncoverers]

I had already seen your design hash set video and was able to solve this one.Thank you

[@souravjoshi2293]

thank you legend. I have seen a great improvement in my dsa because of this channel

[@tassawarhasib8323]

Hi your teaching style is excellent, Loved the explanation.

[@iamnoob7593]

Wow brilliant explanation

[@codestorywithMIK]

Means a lot to me, happy it helped! 🙏

[@AlishaKhan-ww3io]

Thanks a lot for improving my coding skills.

[@anshumaan1024]

I have a doubt auto& chain = buckets[bucket_no] , yha humne '&' kyo lagaya ? yha toh bina '&' ke bhi toh by reference hi jaata na ?

[@anuppatankar4294]

Great Video 🔥

[@codestorywithMIK]

Thank you 😇🙏

[@--Blood--Prince--]

Hi ur teaching style is awsm ...can you plz make a video on alien dictionary thanks.

[@codestorywithMIK]

Means a lot. Thank you so much. Sure, let me plan soon when I get back to India after some days . 😇🙏

[@--Blood--Prince--]

Thankyou

[@shivamdave1050]

I love your dedication, can you tell me from which resources did you study dsa yourself?

[@codestorywithMIK]

Hello Shivam, Thank you for your kind words. 😇🙏 Actually i never took any paid course to study dsa. I studied from online free resources like GfG , KZbin , and practice from leetcode mainly. But i noticed that there were no good channel on KZbin which discusses the INTUITION building from scratch and in friendly way, so I created my own channel to share my way of studying dsa. I really hope it brings a change in the way people today study dsa. Thank you for trusting my small channel and being with me in this journey. ❤️😇🙏

[@pradeepranjan8226]

@@codestorywithMIK It is bringing change in problem solving for sure.

[@codestorywithMIK]

❤️🙏❤️❤️

[@UECAshutoshKumar]

Thank You!

[@xiaoshen194]

I thought U already had a video on hashmap. But turns out it was on hashset. Anyways, my recent comment on that video explains the difference between vector of vectors and vector of lists and when to use what 😅.

[@codestorywithMIK]

Thank you 😇

[@yikes3807]

Loved the explaination of theory thanku

[@codestorywithMIK]

Thank you for watching 😇🙏

[@nagmakhan3165]

Crystal clear

[@HarshMishra-cp7tj]

100 Subs left Bhhhaiya for 10k

[@codestorywithMIK]

Means a lot. Thank you for supporting me 🙏🙏🙏

[@newglobal7271]

Ajj bhi maja agya lakin 705 Qs ka video dekhneke baad..

[@codestorywithMIK]

Thank you 😇🙏 Actually i intentionally kept this video small because major concepts were taught in leetcode 705 video. Hope it helped 😇🙏

[@newglobal7271]

Yes Bhaiya , it helps a lot , Because of you I am consistent in LeetCode daily challenges , Thank You 🙂🙂🙂🙂@@codestorywithMIK

[@codestorywithMIK]

@newglobal7271 So glad to know. Thank you for joining this journey with me 😇🙏

[@FanIQQuiz]

clear as always

[@wearevacationuncoverers]

clear 👌

[@vivek.tiwary]

Can you take up leetcode 457 . It's was difficult to understand, I was looking for an explanation like you do. Thanks in advance

[@codestorywithMIK]

Let me note this. For sure.

[@nadeking1530]

Just one doubt , diff between emplace back and push back, i tried googling but answers werent satisfactory, can you explain please

[@codestorywithMIK]

Hey there, "push_back()" takes an existing object (either a copy or an rvalue reference) and adds a copy of that object to the end of a container (vector or list) "emplace_back()" It constructs the object "in-place" at the end of container, by forwarding the arguments to the constructor of the object directly. This can be more efficient than push_back(), especially when dealing with complex objects, because it avoids the overhead of creating a temporary object and copying/moving it into the container. Hope this helps ❣

[@abhayshukla322]

Hi bro , could you please share what tools you use to make these videos? I want to create my dsa notes and this time in a digital way

[@codestorywithMIK]

Hey Abhay, I make them using default NOTES app in apple ipad 11 pro. I don’t have any mic. I use the default mic on ipad.

[@thefinalfit]

Thank you again

[@MounikaEMB]

👏

[@codestorywithMIK]

Thank you for watching and trusting my small channel 🙏

[@trailsnail]

one optimization i saw for these solutions was of using a large prime number for the value of size. How does that help? does it make the size of the bucket smaller or is it making the length of the chain smaller?

[@codestorywithMIK]

Interesting. Let me explore and share

[@dhairyachauhan6622]

@@codestorywithMIK the reason is simple prime gives minimum collisions. :) also bhaiya will the time be effected if i use a vector

[@codestorywithMIK]

@dhairyachauhan6622 Thanks a lot for sharing this information with me. No the time will not be impacted because you in vector also you can push_back element in O(1) time

[@JitendraKumar-ud5yc]

class MyHashMap { public: vector v; MyHashMap() { } void put(int key, int value) { remove(key); v.push_back({key,value}); } int get(int key) { for(auto it:v) if(it.first==key) return it.second; return -1; } void remove(int key) { if(get(key)!= -1) { for(auto it = v.begin(); it != v.end(); it++) { if(it->first==key) { v.erase(it); return; } } } } };

[@codestorywithMIK]

Thank you for sharing 👌

[@aman3210]

thankyou ++ bhaiya

[@codestorywithMIK]

Thank you 😇🙏

[@ashutosh61290]

first😂

[@dayashankarlakhotia4943]

class myHashMap{ int []data; public my HashMap (){ data=new int (1000001); Arrays.fill(data,-1); } public void put(int key,int value){ data[key]=value; } public int get(int key){ return data[key]; } public void remove (int key){ data[key]=-1; } };

[@atmanirbharofficialindiaon2789]

Sir dover me job lag gyi glti se bas 12 lpa de rahi, college wale aage companies me nahi baithne de rahe which includes adobe, visa, cisco, etc. Kya karu bahut ganda feel ho raha

[@codestorywithMIK]

Hi there, I would suggest you to join it. But keep preparing in parallel. It’s ok if the college if not allowing you to apply. Once you are prepared well, apply offcampus. From LinkedIn, Referrals etc.

[@atmanirbharofficialindiaon2789]

​@@codestorywithMIKbut offcampus is soo harder, i am so afraid and dreaded about my future, got a nightmare also yesterday. I was so dumb to even apply for this company while my friends skipped it