01. Internal Working of HashMap & Java-8 Enhancement

you said that the capacity will be increased if 12 buckets will be full (for initial capacity = 16), but if i try to use class, which hashCode() always returns 1, as a key, then all the new pairs will be stored in one bucket with index 1 and according to debugging the capacity will still be increased. doesn't this mean that the load factor depends on the number of pairs in the hash map? not on the number of buckets with pairs

A great explanation ,one of the best video till now i watched on Hashmap internal...Thank you for sharing a such content😊

Good lecture. Helpful

Kindly note that when hashmap is passed the duplicate key, it calls the hashCode() method to generate the hash value for the key and this hash value helps in determining where to put this new entry but since this index/position already has one entry. Since each bucket stores the entry/ies in the form of a linked list so new entry will be added at the top/right end of the linked list. The same logic will be applied if another duplicate key arrives. Please note, when we try to retrieve the value by passing the key(which is duplicate in nature), hashmap goes to the appropriate index by calculating the hash value and traverses the linked list, and returns the most recent value as all the keys are same.

amazing explanation, thank you

One of the best tutorial for this topic

Super Awesome. This is what I was looking for.

Thanks, It's really neat & clear explanation🎉🎉

xactly what the doctor ordered.

Very nice explanation.Thank you

Sir plz provides notes

very good explanation

very good explanation...

Very easy to understand. Thank you!

Can you make videos on spring and springboot

Very nice explanation

Excellent explanation worth a watch🔥🔥

you can use a primitive type as a key in a HashMap. When you add a primitive type as a key, Java will automatically wrap the primitive value in an object of the corresponding wrapper class

Till now i have seen so many videos about the HashMap collision, this is one which explains every thing without any chance of doubt. Great great Job..........!!!🤩

well explained... good one

Awesome explanation Sir....

This video is very helpful to me and the example with the diagrams clears all doubts , bt still having one doubt how can I calculate the index using given formula? Can you please describe it?

Thank you for the clear explanation

Great session, neat and good explanation. Thank you

Very cool keep it up

Thank you for the explanation!

Awesome Explanation

Thanks for making life easier

Thanks man! You made it far easy...

your explanation is great . try to make more videos on java .

Nice video

Best video I have come across....It would be great if you can add tutorials on multi-threading and concurrency topics....

Tysm for simply explanation... I have seen much vdo bt this is the best vdo.. Tq once again..🙏🏻

Thank you so much sir....🙏

simple explain for tricky topic, easily understandable.. nice.. 👍

Awesome❤

Bhai Kya explain Kiya hai..Thank you so much...Can you please create video on ConcurrentHash map, Difference between Hashmap, Synchronized Hashmap and Concurrent hashmap

Nice Explanation

could you please elaborate more on how equal hashcode strings will be saved in same buckets ?
You have mentioned compareTo () method will be use. But more detailed explanation might help. Thank you.

that was some explaination 😎

Good going mate. Keep it up.

Can uh make more videos on Java

According to keys, pair is searched, not as per Bucket number
Hence, one bucket can have many pairs linked by LinkedList

Best Explanation ever…have seen so many videos but this is the best, Thank you 🙏

You are awesome at explaining complex topics. Thank you.

How to find bucket index plz explain...

Appreciated the way you explained the concept. Thank you.

Good explanation 👍

I have never seen such detailed tutorial about the hashmap! I want to thank you, even I knew how it works.

Thank you so much for this video I was actually able to visualise internal structure of the hashmap