I have read about this from multiple resources.But I had never seen it in real 'how exactly it works'.You have explained so beautifully.Its just amazing. I would say you are "THE DRONACHARYA" (who was was royal preceptor to the Kauravas and Pandavas.) Thank you so much for making this awesome video.Its so clear and precise.Thanks
@@naveenautomationlabs I want to get strong in logic building.I appeared for an interview but did not get selected in first round.They asked to write a program which would take input an Integer array having only zeros and ones and output will be sorted Integer like 000011111.I could not answer it. Actually Naveen,I need a proper plan and guidance to get strong in my programming skills.Please guide me if you provide any personal training I would like to enroll for it as its high time and I want a change in my career.
@@soumyajit443 use Sort Class int arr[] = {0,1,0,1,0,1,0,1,1,0,0,1}; Arrays.sort(arr); System.out.println(Arrays.toString(arr)); o/p - [0,0,0,0,0,0,1,1,1,1,1,1]
Thanks sir....i searched many time for working of hashmap. But Didn't satisfied with explanation all they have. But after ur video now I am cleared about hashmap. Your explanation in simple and better 🙏 thnks sir
I appreciate your research on Hashmap implementation under the hood, I remembered my college day's Hashing concept implementation, now I see in reality in debug mode. Thanks, Naveen. this is called bridging the gap between institution and industry. :)
In Java 8, HashMap replaces linked list with a binary tree when the number of elements in a bucket reaches certain threshold. While converting the list to binary tree, hashcode is used as a branching variable. If there are two different hashcodes in the same bucket, one is considered bigger and goes to the right of the tree and other one to the left. But when both the hashcodes are equal, HashMap assumes that the keys are comparable, and compares the key to determine the direction so that some order can be maintained. It is a good practice to make the keys of HashMap comparable. This JDK 8 change applies only to HashMap, LinkedHashMap and ConcurrentHashMap.
Excellent explanation Naveen . I was so scared to learn the collections concept in java. But you have made it like a cupcake . Thanks much for your time and effort. I don't think even the paid courses will give this much explanation for each nuke and corners.
Earlier I have tried to understand the "Hashing Concept" from several sources but it seems very confusing but the way you have expalain now this concepts has cleared now. So, Here after I can explain the hashing concept to anyone. Thanks !! Naveen
Awesome explanation, but if the hashing explanation is more, like how it's calculating in which node the value will be inserting, then it will be the best-ever i saw in youtube.
The best explanation on How hashmap works internally, I have seen so many videos but I get confused instead of understanding but this is PERFECT....Thank you...
Thanks, Naveen for creating this whole java collection video series. In this series, you have really explained each and every collection framework topic in an awesome way and In fact, I am following a couple of automation tutors on RU-vid but no one has explained these topics in such an easy and understanding way. 😊👍👍
I think while inserting means put missed one point: at 11.10 The value 4 is the computed index value where the Key will be stored in HashMap. In this case, equals() method check that both Keys are equal or not. If Keys are same, replace the value with the current value. Otherwise, connect this node object to the existing node object through the LinkedList. Hence both Keys will be stored at index 4.
Very well and crisp with what is required and the clarity of topic stays longer in mind ..with so neat and clear explanation.Hope you keep posting more content on data structures and common topic which are required longer
really good explanation... learning from your channel is very much easier than reading stuff on internet and reading books... precise explanation with good examples clears the concept easily rather than getting confused in it... appreciate your efforts and your easiness towards teaching these concepts... you do it so confidently and so easily... thankyou so much...
Wow.. what a wonderful explanation Naveen. Kudos to you for teaching this complex concept in such a simplified way. Really appreciate the hard work you would have put in to break this one brick by brick. :)
@naveenautomationlabs loved the explanation . Its actually amazing how you take this valuable time in explaining and putting out the most relevant explanation. Actually a FAN of yours.
Thanks a lot Naveen. This was much needed to understand the internal working. 😇 Especially the debugging how it is calculating the hashcode is ultimate.
Your each video is so well explained .. after going through your videos my base is getting cleared on many topics .. keep making good videos.. god bless you for ur hard work ..🙏🙏
Thanks a lot Naveen. You are right, it really gets difficult to understand from documentation, we need practical implementation, and as always you made it easy :).
Exceptionally well explained , I would really like to express my gratitude for such a marvelous and clear explanation. To be honest I am able to understand and register it very nicely. Many thanks and God bless dear.
Thanks much Naveen for the very detailed explaination.After subscribing to your channel started learning Automation core concepts with confidence. I couldn't even think of my youtube search without this "Naveen automation labs" prefix for Java, python, selenium, design patterns POM, BDD, Github, Jenkin's, concepts, etc, and whatnot.
When we put a duplicate key internally it replace the value or create a new node. Plz ans sir.. And it is the best explanation i have ever seen on this topic.
