Design HashMap | Live Coding with Explanation | Leetcode - 706

The video explains in detail working and implementation of HashMap data structure

To support us you can donate

Check out our other popular playlists:

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 #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode

[AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! 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!!!🙂🙂🙂

[SurajSingh-tzwr]

This video is so self-explanatory and the solution is so clean. Loved this video. Thanks a lot!

[satheshbm]

The clearest explanation, I found for the problem. Great work :)

[pritisharma]

very clear and concise explanation, and in a short video, thanks for posting

[fantasy]

best of the best! thank you for your effort !

[abcdeereijgfhd]

This is the clearest explanation I have found so far. Thank you. BTW your typing speed is unrealistic. Did you fast-forward the video or just have the fastest finger? haha~!

[xinniu]

Thanks for sharing this answer, could anybody explain why the time complexity is O(1)? and why space complexity is O(N)? And also, at 4:18, why size of 769 makes the hashing efficient? Thank you!

[YNA]

Hello thanks for the video. I have a question regarding the time complexity being O(1). Why is that so? Should it not be O(n) because for each method, in the worst case, you will have to traverse through a whole list? Hope you could clarify, thank you.

[prachiraval]

How to print the final map after giving put and get method

[ujjvalsharma]

Wonderful video!! Keep making great videos

[ashwanisingh]

Why are we creating Entry class.Can u plz explain

[ammarshareef]

How are we solving the issue of collisions in this problem.

[iliasolovev]

Why did we use toRemove variable? Why just we din't remove in right there like map[bucket].remove(entry)? Because it can cause

[dhruvkaran]

in remove when we found our key y we did not break; ???

[sammedsankonatti]

why do we use Entry object to iterate like for(Entry entry : map[bucket]). didn't get that.

[ramkumar_balu]

Why array of LinkedList? Can it be another DS?

[nishantchoudhary]

your solution in this video are not working

[rashmikiranpandit]

For both the methods, the space used was almost the same, I wonder why did we use so complex method then

[harishreddy]

This solution is good but I'm 100% sure the follow up question would be on collision which was not handled here and needs to be handled

[lokeshsenthilkumar]

Awesoom
try to post the video before 5pm pls