01. Internal Working of HashMap & Java-8 Enhancement

#java #interviewquestions #webencyclop

In this playlist I will try to cover all the important java interview questions along with answers in very intuitive, kind of pictorial/animated way.

Complete Playlist:

Next Video:

Video includes:
- 00:16 What is internal memory structure of HashMap?
- 06:41 What is a Hash Collision?
- 10:35 How to search element in LinkedList
- 14:30 Why we need enhancement in Java 8 HashMap, what was the problem before?
- 15:03 Java 8 enhancement in HashMap, (storing elements from LinkedList into Tree structure)
- 15:15 What is treefy threshold in HashMap ?
- 18:08 What is red-black Tree in HashMap. Binary Search Tree or Self Balancing Tree.

In this series we will be covering all Java interview questions and answers. This is going to be comprehensive list of Java interview questions which can help experienced Java developers to prepare for an interview as well as upskilling the Java knowledge.

I would always recommend everyone to watch Durga Sir (durgasoft) videos because of extensive in depth explaination on all topics if you have more time.
But here we will try to cover important aspects of Java Programming which are always asked in interviews withing less time.

We will be covering below topics in the video.

1. Hashmap Interview Questions
2. Hashmap Java 8
3. Hashmap Java Coding interviews
4. Hashmap in Java by Durga
5. Hashmap Java Interview Questions
6. HashMap internal working
7. equals-hashcode
8. get method
9. hashmap in java
10. internal-working-hashmap
11. interview-questions
12. java 8
13. java tutorial
14. java-8-nehancement
15. put method
16. job interview questions and answers
17. behavioral interview questions and answers
18. job interview tips
19. Interview questions and answers
20. Animated java
21. java animation
22. java programming tutorial
23. Hashmap java 8
24. learn java
25. java tutorial for beginners
26. Hashmap enhancements in Java 8

[evgenii]

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

[aniketbharsakale]

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!

[yogeshpawarvlogs]

The way he represents the data is phenomenal...
Thums up for his presentation. 👍👍👍

[imanidesireejones]

wow so easy to understand. I like how you actually explain certain keywords instead of grazing over concepts. this was so helpful thank you!

[Veronica-vqiz]

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.

[pratikjagadale]

Tried a lot on the internet to understand hashmap working ... finally brother understood from your video👍👍👍

[sharanyabhiram]

Hey your core java interview series is very helpful.. I wish you continue doing many more topics in this.

[nitincareer]

Excellent video on Hashmap so far, keep doing more like this.

[maheshchennamsetti]

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.

[gudesreekanth]

Best explanation so far in youtube on hashmap internal working... Nice buddy!! Appreciate your effort ...

[ahir_shubham]

Beautiful explanation with specially the images...felt very comfortable to understand...Keep going...Thankyou!

[AzeriFire]

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

[kusumbhatt]

You explained this concept in detail, this is very helpful... thank you!!

[mohammadsadeghi]

You are awesome at explaining complex topics. Thank you.

[manishpatidar]

Picturial representation makes this videos excellent... It will be easy to remember the flow chart

[shilpakothre]

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.

[lavanyapadma]

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

[AkhileshKumar-lime]

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.

[parambharti]

Great explanations. Thanks !! Please keep making more videos. Nice way of teaching.

[kumarprakash]

Appreciated the way you explained the concept. Thank you.