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
Your pictorial representations, the images & the color that's choosen for slides, the way you have explained it so neatly, its commendable. You have simplified a tough concept and making complex things look simple is an art. Great job. Good going!
I have seen many videos but I am wasn't satisfied with any of them .After seeing this video I got an absolute clarity thanks to this man for explaining in such a detailed way.
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..........!!!🤩
This is such a super easy explanation! I've watched many videos on this topic, but this is by far the best. Clear, concise, and so easy to understand. Great job!
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.
thankyou so much. its really excellent explanation with neat slides, think your the best tutor to explain the concept in a simplified manner. I think its the best video on hash map .
Wow, what a prefect explanation it was. Thanks a lot man for this smooth explanation, We're looking forward for many videos, but you have stopped posting it.
You are awesome you explained it so clearly your animation are awesome great work .. You should be in udemy not on youtube .. Impressed with your work ..
Appreciate your feedback, I will keep this in mind for next videos and try to improve. Please let me know if you have some feedback on how can I improve to make it simple ?
Hi sir ,The way your explanation is spoon feeding, if we see screenshot at the end we get all the details about hashmap . I would request create some sessions about springboot . 1.springboot security (authentication: Authorization) 2.springboot transaction a.what is the purpose of transaction and etc 3.what is different b/w jdbc/spring jdbc /hibernate/spring data jpa 4.spring xml vs spring boot 5
if hashmap size reaches above load factor i.e(3/4) of initial size than it will double the size of hashmap in such case it will rearrange key or not because size of hashmap is increased.please clarify on this point
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
ah good catch, let me pin 📌 this post. thanks for your comment.
thank you for your comment! good point!
nice observation, thanks for sharing this
Is loadfactor depending on number of entries in Hashmap? @webencyclop (if not what is the meaning of pairs here? what does this pair signify?)
@@dhanashreekamali3185key and value😊
Your pictorial representations, the images & the color that's choosen for slides, the way you have explained it so neatly, its commendable. You have simplified a tough concept and making complex things look simple is an art. Great job. Good going!
Thanks a lot for praise & motivation!
@@ankit.wasankar Please upload more videos ... Very much helpful. Thanks.
Agree.
🎯 Key Takeaways for quick navigation:
00:00 *Interview question introduction*
00:13 *Creating new jobs*
01:10 *Subscribe for updates*
02:22 *Journey components*
03:49 *Multiple nodes concept*
05:09 *Hash code importance*
06:47 *Calculating values*
08:51 *Node equality check*
10:35 *Item searching process*
12:29 *Time complexity overview*
14:13 *Notification system*
15:11 *Tree conversion process*
16:04 *Web content benefits*
16:28 *Tree structure benefits*
16:52 *Search optimization method*
17:23 *String comparison methods*
17:58 *Red-black tree definition*
18:11 *Binary search tree*
18:29 *Tree conversion process*
18:49 *Future interview questions*
Made with HARPA AI
I have seen many videos but I am wasn't satisfied with any of them .After seeing this video I got an absolute clarity thanks to this man for explaining in such a detailed way.
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..........!!!🤩
thank you..
The way he represents the data is phenomenal...
Thums up for his presentation. 👍👍👍
very neatly explained basics of working of hashmap,linkedlist,tree
Tried a lot on the internet to understand hashmap working ... finally brother understood from your video👍👍👍
Best explanation so far in youtube on hashmap internal working... Nice buddy!! Appreciate your effort ...
best video on HashMap internal working and loved your content.thank you for such great content.😊
This is such a super easy explanation! I've watched many videos on this topic, but this is by far the best. Clear, concise, and so easy to understand. Great job!
Picturial representation makes this videos excellent... It will be easy to remember the flow chart
Best Explanation ever…have seen so many videos but this is the best, Thank you 🙏
I have never seen such detailed tutorial about the hashmap! I want to thank you, even I knew how it works.
Beautiful explanation with specially the images...felt very comfortable to understand...Keep going...Thankyou!
wow so easy to understand. I like how you actually explain certain keywords instead of grazing over concepts. this was so helpful thank you!
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.
Wow, you explained it so well, I have watched so many tutorials for this concept and never had this deep understanding. Thank u so much.
Thanks from a user from Viet Nam
Your explanation was so easy to understand although it's hard to understand your english as much :)
A great explanation ,one of the best video till now i watched on Hashmap internal...Thank you for sharing a such content😊
thankyou so much. its really excellent explanation with neat slides, think your the best tutor to explain the concept in a simplified manner. I think its the best video on hash map .
Best explanation for hashmap. Thanks!
Excellent video on Hashmap so far, keep doing more like this.
Superb.... you are the best.... god bless you
One of the best tutorial …. Thank you
Best tutorial I have ever seen. Thank you.
Hey your core java interview series is very helpful.. I wish you continue doing many more topics in this.
Thank you sooo much because of your this video i understood the internal working of hashmap after so many days. Nice explaination...🙏🙏
Best video on working of Hashmap . Also the treeify threshold concept is well explained. Thank you!!
Plz make full collection type video ur way of represente slide in pictorial way is wonder full .keep it up......
Wow, what a prefect explanation it was.
Thanks a lot man for this smooth explanation,
We're looking forward for many videos, but you have stopped posting it.
Sir your teaching is so good and simple and so effective...
Thank u for explaining in such a wonderful way. Before watching this video I have lot of confusion in this topic. This clear my all doubts.
Tysm for simply explanation... I have seen much vdo bt this is the best vdo.. Tq once again..🙏🏻
If you can, please go through my description & give a star to my repo. It'll be very helpful to me. Thank you ✌️
One word... "AWESOME"
Thank you so much for this video I was actually able to visualise internal structure of the hashmap
Appreciated the way you explained the concept. Thank you.
Best Representation, Really helpful, request to you please create video on "Internal working of HashSet"...
Great explanations. Thanks !! Please keep making more videos. Nice way of teaching.
crystal clear explaination👌👌👌
You are awesome you explained it so clearly your animation are awesome great work .. You should be in udemy not on youtube .. Impressed with your work ..
You are awesome at explaining complex topics. Thank you.
Represented in very simplified manner...👍
simple explain for tricky topic, easily understandable.. nice.. 👍
If you can, please go through my description & give a star to my repo. It'll be very helpful to me. Thank you ✌️
You are LEGEND man! The way you explained I can answer hashmap even after death :D
Excellent content & presentation. Eagerly waiting for the new videos. Please keep up the good work!!!
Very good explaining not able to find anywhere else
You are making things more complex
Appreciate your feedback, I will keep this in mind for next videos and try to improve. Please let me know if you have some feedback on how can I improve to make it simple ?
@@ankit.wasankar your things are simple and easily understandable .Thanks a lot for video on working of hashmap
Bro, one of the best video I've seen. Proper explanation , diagram. 🔥
You explained this concept in detail, this is very helpful... thank you!!
Extraordinary explanation pls make more videos in this playlist
easy to understand explanation. Kudos!!
Amazing explanation👍👍
V good explanation, simple and on point. Thanks and Keep making more videos like this!
Wow. Well explained the concept with practical example👏 And Thank you for the clear explanation. Your channel deserves more subscribers
Really aprreciate the hardwork. Cn you please make a playlist of all java collections and their internal working.
Please Upload more videos.....your explanation is just awesome👌👌👌😍
Thanks, man thanks a lot finally my concept is cleared, One of the best explanation I got on youtube
Very easy to understand! Great job!
Thanks for the explanation. It was very helpful
superb explanation ,it cleared the concepts.Kindly post the multiple thread and design pattern concepts of java
Just awesome.....Thanks you sir!
Amazing explanation. Thanks. Please prepare some more videos.
Very precise explanation.Thanks a lot
Thanks man! You made it far easy...
Best video I have come across....It would be great if you can add tutorials on multi-threading and concurrency topics....
Hi sir ,The way your explanation is spoon feeding, if we see screenshot at the end we get all the details about hashmap .
I would request create some sessions about springboot .
1.springboot security (authentication: Authorization)
2.springboot transaction
a.what is the purpose of transaction and etc
3.what is different b/w jdbc/spring jdbc /hibernate/spring data jpa
4.spring xml vs spring boot
5
One of the best tutorial for this topic
Explained very well. Thank you :)
Thank you for the explanation. It's really helpful.
All is best ....very nice
It was a nice explaination..easy to understand👍...Please upload a video on internal working of hashet..
Well documented video. Thanks
Excellent explanation worth a watch🔥🔥
thank you 🙏
Excellent explanation.
Very nice, love it
Super Awesome. This is what I was looking for.
Very easy to understand. Thank you!
Thanks for well explanation .
Glad it was helpful. Please like and subscribe | thank you 😇
Excellent Explanation
your explanation is great . try to make more videos on java .
Really well explained !!
Thanks for the wonderful explanation.
Thank you sir. You are excellent.
Great session, neat and good explanation. Thank you
Good explanation 👍
Good going mate. Keep it up.
Thanks so much. It's very helpful for me.
if hashmap size reaches above load factor i.e(3/4) of initial size than it will double the size of hashmap in such case it will rearrange key or not because size of hashmap is increased.please clarify on this point
Yes, ,it will do re arrangment. It's an expensive operation.. This process also called as rehashing.
Awesome Explanation
You are a star man ... thank you :)
Perfect one!! 😊👍
Thanks, It's really neat & clear explanation🎉🎉
very good explanation.
that summary work flow is awesome.... it help much better than your whole explanation
Hi Sir, it is wonderful and steady explanation. Thank you so much for this video. I will subscribe to your channel today itself.
the way you explain along with pictures, will directly go to mind.
Best explanation till date, please create more java videos
Best Explanation ever 💯
Awesome explanation Sir....
Thank you
Good lecture. Helpful