Great video! One addition to the last question on implementation of HashMap Since Java 8, once a threshold limit is reached for the number of linked list elements added at a particular node, the linked list is re-ordered to a binary tree to implement faster search for collision cases.
Thanks for wonderful comment kathiravan. you might not know this but you made our day and all the efforts we did now turned meaningful bcz of such nice words🙏🙏. We , team code decode is grateful 🙏🙏. keep learning Kathiravan, you will surely land at your dream place really soon. all the best 👍👍👍👍
This is my first ever TH-cam comment. I just logged in to youtube so that I can comment on your video. You are awesome. Very well explained, very well organised. Keep it up. No nonsense videos. I am preparing for my interviews using your videos only. Pls countinue uploading many such videos.
This is a awesome 'Ready Reckoner'. I watched this and all are explained clear and to the point. This is great effort by the creator. Please make more topics and please make more videos. I totally understood the points. All the very best team 👍👏 With Regards, Prakash Karuppusamy
Hi Mam, this video about collections helped me during my interview with TCS and I secured a job offer! Thank you very much and I will continue to look through your other videos to help broaden my knowledge
Ma'am, thank you for this. It really helped me in cracking Amdocs. I was able to recall the exact same thing you taught in this video. I can say, that I've done DSA and used every framework that's why it looked very understandable at the very first go.
HI Anshuman , Bro i have an Amdocs interview in upcomming week. Can u pls help me in that like how is the interview and what questions were asked in that interview please ? Can we connect?
@@moneymastermind-w7c Topics- Java, Oops, Threads, Collections, SQL, DBMS, Unix commands, 2 programming questions. Go through interview experiences from gfg & Coding Ninjas/CodeStudio, that'll be enough. Mine was for developer profile.
@@anshumanpanigrahi7817 Thanks a lot for reply bro. Mine interview is also for developer role 2 years of experience. May i know what type of programming questions were asked in interview ?
from Java 8, the linked lists are dynamically replaced with balanced binary search trees in collision resolution after the number of collisions in a given bucket location exceed a certain threshold. This change offers a performance boost, since, in the case of a collision, storage and retrieval happen in O(log n).
For others who are interested in that particular topic, the threshold by default is 8 as far as I remember. :) So "after" 8 nodes, LinkedList is being switched to Tree Balance Structure.
16:07 ConcurrentModificationException:- When modification is performed on a collection by the same thread which is iterating over that collection. It's not about two distinct threads for iterating and modifying.
In case of hash collision it also uses equals method to check if key is same. If it is same then it updates the value. Otherwise, new node is inserted.
This special video covered all related to collection and its interview questions have watched so many videos about that but here have learnt in very different way thanks for sharing such valuable content in the video keep sharing like this we get to learn more..❤❤
Hello Ma'am, I have learnt a lot from your channel thank you so much. I have one doubt here that the linked list does not support index based search but it has a get method through which the element is at a specific position?
Really a nice approach to make understand the topic. Just one request, plz add some behavioral questions related to collection as interviewer can ask that also.
Explanation is awesome. Just a suggestion. In the diagram just put dotted line for interface and solid line for class. So while seeing the diagram people will understand the concept.
Hi,As you mentioned, Hashset simply implements Hashtable. It means Hashtable is an interface. But hashtable is class, right? Can you please comment on this?
" Implemented " by this i didn't mean inheritance . I meant how we code it. It means in real time we implement set using hash table. Means it's backed by hash map/ hash table . Sorry for your confusion. Implemented is a term used in both English language and in technical terms
thanks for all the tricky quaetions, please explain the HashMap with some examples and this is very short. because i was understanding this only theoretically but havent't implemented. bit more explanation on hash map.. it also talks about the equals() and hashCode() contract..
Thanks for the video. It's really helpful for interview preparation. One small doubt I have in 6:57 you said hashset internally implements hashtable and one null value can contain. But hashtable doesn't contain any null key and null value.. Please explain and correct me.
Question: If the key of Hashmap is Immutable Object(properly create by developer with no mistake or let's say it's String class object) then do we need to override hashcode() and equals()? Or having immutable field as key solves the problem of overriding hashcode() and equals()?
It helped me in my interview preparation.. thanks
Hope you get all your interviews cleared. All the the best 🤟
@@CodeDecode aa
Kuthe rahto bhau tu? Do u want to take live instructor led classes? I have over 5 years of experience in corporate.
@@realnileshpawar how do i contact u?.
Yes
Though I knew about the framework completely, I had an issue explaining it in an organized way, you are just awesome!
Thanks 👍
Great video! One addition to the last question on implementation of HashMap
Since Java 8, once a threshold limit is reached for the number of linked list elements added at a particular node, the linked list is re-ordered to a binary tree to implement faster search for collision cases.
Thanks for the info
Binary but Binary Search Tree right?
@@JenilCalcuttawala red black tree
Beautiful Effort.IT Field will remember your name forever.
Thanks for wonderful comment kathiravan. you might not know this but you made our day and all the efforts we did now turned meaningful bcz of such nice words🙏🙏. We , team code decode is grateful 🙏🙏. keep learning Kathiravan, you will surely land at your dream place really soon. all the best 👍👍👍👍
I have read theory before but confused after this video cleared all doubts about Hashmap,, thanks a lot
We are glad to know that this helps Ganesh 🙏👍
SortedSet uses Comparator(Comparator
Great Explanation!!!
One more point: Hashtable doesn’t extend Hashmap.
It extends Dictionary Class.
👍👍
This is my first ever TH-cam comment. I just logged in to youtube so that I can comment on your video.
You are awesome. Very well explained, very well organised. Keep it up. No nonsense videos. I am preparing for my interviews using your videos only. Pls countinue uploading many such videos.
Thanks Pallavi 🙂👍
This is a awesome 'Ready Reckoner'. I watched this and all are explained clear and to the point. This is great effort by the creator. Please make more topics and please make more videos. I totally understood the points. All the very best team 👍👏
With Regards,
Prakash Karuppusamy
Thanks for the nice words Prakash. We will sure make more videos like this ....
Very informative and quick to brush up collection framework with examples.
Thanks Robin 🙂👍
your phone vibrates in almost all of your videos. thats very nice :-). it's not a complaint, take it as a compliment
we fixed this issue in new videos. Thanks 👍👍😊😊
how this can be a compliment? :D
Hi Mam, this video about collections helped me during my interview with TCS and I secured a job offer!
Thank you very much and I will continue to look through your other videos to help broaden my knowledge
Best i have seen before the way ur explaining very well thank you
you're welcome venkat
The way you explaining each topic is awesome.
Thank you for the amazing video.
Thanks for the nice words.....
How many interviews I've cleared listening to this video ! Thank u :)
Many many congratulations on clearing your interviews!! Keep learning keep shining 🌟🌟
Seriously very great explanation ❤️
Thanks a lot 🙂🙂👍👍
Thanks a lot.. The best Collection summary available on YT.
It enhanced my knowledge for sure. Thanks.
Ma'am, thank you for this.
It really helped me in cracking Amdocs. I was able to recall the exact same thing you taught in this video.
I can say, that I've done DSA and used every framework that's why it looked very understandable at the very first go.
Congratulations Anshuman 🎊🎊🎉🎉
HI Anshuman , Bro i have an Amdocs interview in upcomming week. Can u pls help me in that like how is the interview and what questions were asked in that interview please ? Can we connect?
@@moneymastermind-w7c Topics- Java, Oops, Threads, Collections, SQL, DBMS, Unix commands, 2 programming questions. Go through interview experiences from gfg & Coding Ninjas/CodeStudio, that'll be enough.
Mine was for developer profile.
@@anshumanpanigrahi7817 Thanks a lot for reply bro. Mine interview is also for developer role 2 years of experience. May i know what type of programming questions were asked in interview ?
Thank u so much,your way of explaining concepts are wonderful.I am feeling so confident in Java after watching your interview questions.
Thanks Shivani 👍👍. Keep learning keep shining ⭐✨⭐✨
Really very good explanation.
We are lucky to watch this.
Thanks Vinod 👍
Everything explained to the point!! Thank you for making great videos
Thanks Savita 👍
Very clear explanation.. and provide example code 👍👍👍👍
Thanks Siva 👍👍
5 lakh 48 thousand + views
Congrats 🎉🎉🎉
Thanks Rishi for your constant support
Nice explanation friend thank you very much for sharing.
Thanks for the nice words 👍
Thank you, nice explanation of all collections, mostly I like internal working of hash map, got the more clarity….
th-cam.com/video/7k0VYHuUF6g/w-d-xo.html
from Java 8, the linked lists are dynamically replaced with balanced binary search trees in collision resolution after the number of collisions in a given bucket location exceed a certain threshold.
This change offers a performance boost, since, in the case of a collision, storage and retrieval happen in O(log n).
Yes we have covered that in latest videos I. E. top interview questions 👍👍. Thanks
For others who are interested in that particular topic, the threshold by default is 8 as far as I remember. :) So "after" 8 nodes, LinkedList is being switched to Tree Balance Structure.
Very good questions and their detailed explanation. Thanks 👍👍
Thanks for the nice words...
16:07
ConcurrentModificationException:-
When modification is performed on a collection by the same thread which is iterating over that collection.
It's not about two distinct threads for iterating and modifying.
very clear and crisp explaination 💥
Thanks Shubham 🙂👍
Beautiful voice.. 😅 and the content is so good that you almost covered main topics that can consume most of the time at institutes.
Thanks Ravi 🙂🙂
In case of hash collision it also uses equals method to check if key is same. If it is same then it updates the value. Otherwise, new node is inserted.
This special video covered all related to collection and its interview questions have watched so many videos about that but here have learnt in very different way thanks for sharing such valuable content in the video keep sharing like this we get to learn more..❤❤
You just nailed the Collections . One small request please do video on Collections on Java 8 prospective.
Sure will make a seperate video on Java 8 specific changes
Thank you mam .....your way of talking/understanding.....love it
You're welcome kamal.....
❤
Good one mam,please continue such videos.
sure we will upload more
Best study video for interview
Thanks 👍👍
Nice work...one mistake is map interface doesnt extends(not implement) Collection interface
Hats off very nicely explained and your presentation is also too good.
Thanks 👍
Superbbb...! your explanation skills are just awesome....
and ur voice is adorable as well. thanks for this questions set it will be really helpful
Thanks Sagar 🙂🙂
Very good. Explanation. Thank You 😊
Thanks 🙏
Yes this is literally most asked and top questions. Thanks.
Thanks
Thank you once again for explaiing clearly
Thanks Chisha Malama 🙂🙂👍👍
Hello Ma'am, I have learnt a lot from your channel thank you so much. I have one doubt here that the linked list does not support index based search but it has a get method through which the element is at a specific position?
Really a nice approach to make understand the topic. Just one request, plz add some behavioral questions related to collection as interviewer can ask that also.
Very good to remember and recollect
Thanks Sanjeev 🙂👍
Nice video keep it up 👍
Thanks ☺️
Thanks for wonderful explanation 🤝
You are welcome
Thank you so much, madam. You explained in-depth and very nicely
Thanks 👍👍
Explanation is awesome. Just a suggestion. In the diagram just put dotted line for interface and solid line for class. So while seeing the diagram people will understand the concept.
That's a very nice suggestion. Thanks 🙏👍👍👍👍
4:42 small correction, I think Linkedlist do allow index base search
very nice but need more questions from collections with demonistration
Sure we will create soon
yes i would love to see internal working of hashSet
th-cam.com/video/7k0VYHuUF6g/w-d-xo.html
Respect for your explanation ma'am...
Thanks 👍
Excellent videos, Thank you so much!
Thanks Nidhi 🙂👍
Very good explanation of Internal working of hashmap. Liked it.
Thanks
Awesome Explanation
Thanks......
Please make another video(part2)on collections tricky questions and include concepts like internal working of hash set
th-cam.com/play/PLyHJZXNdCXsfqAkteaQ6JfZ_IHvxX-Hj3.html
Pleasr create more tricky questions on collections
sure sreeja we will create soon
Such helpful content and appreciate your hardwork Thank you mam!!
Thanks Manoj 🙂👍
Nice explanation,you are doing a great job. Thank You
Thanks Bhushan 👍👍
Very Well Explained.
Thanks Ammar 🙂👍
very nicely explained... eagerly waiting for Multi-threading concepts.. once again good job!
Thanks .......
Awesome video for java collections 💯💯💯
Thanks sakshi 👍
Thanks.. that was awesome 👍
Thanks Sourabh 🙂👍
Wow great explaination
Thanks 👍
Hi,As you mentioned, Hashset simply implements Hashtable. It means Hashtable is an interface. But hashtable is class, right? Can you please comment on this?
" Implemented " by this i didn't mean inheritance . I meant how we code it. It means in real time we implement set using hash table. Means it's backed by hash map/ hash table . Sorry for your confusion. Implemented is a term used in both English language and in technical terms
Very well explained! thank you
Thanks 👍👍
Gem 💎 👌👌👌👌👌
Thanks Nilesh 🙂🙂👍👍
Thank you for a very detailed explanation. :) Expecting more videos like this.
Sure Shamil. We will upload more videos on collection framework
thanks for all the tricky quaetions, please explain the HashMap with some examples and this is very short. because i was understanding this only theoretically but havent't implemented. bit more explanation on hash map.. it also talks about the equals() and hashCode() contract..
Hi Venkat
These are only interview questions. Will create tutorial for this very soon 👍👍
@@CodeDecode sure, thanks
the video is very usefull . at 3.40 you interchangeably used implements and extends keyword . if possible correct that .
thank you madem very good explanation 👌👌👌🙏
You are welcome
Thanks for the great video. Helped me a lot.
You're welcome
Thanks for the video. It's really helpful for interview preparation. One small doubt I have in 6:57 you said hashset internally implements hashtable and one null value can contain. But hashtable doesn't contain any null key and null value.. Please explain and correct me.
Content is really usefull mam! If possible can you attach ppt document also with the video. It would help for quick recap
Thank you so much , I found all my interviews questions from there...We need people like you!
Thanks for nice words chandan
Good content
Thanks 👍👍
You are awesome, thanks for thanking your time to help us on interview preparations!
Thanks for motivating us to put more efforts for community 🙂. We are glad to do that 🙂👍
Please continue and create video for internal working of hashset as well.
Sure👍👍
With this quality of content, you can create a course in coursera / udemy also
🙂🙂
Good video
Thanks
Each and every video is so informative!! Love your content ❤️..
thanks kaushiki
For hashmap internal working, hashcode method is called by hash method of HashMap and hash method calculates index based on hashcode value
th-cam.com/video/7k0VYHuUF6g/w-d-xo.html
OMG this is really what java developers are looking for
Please make a video for Spring interview questions as well..
Sure will do that soon
Code Decode anyway the way you explain is just wow 🤗🤗
thanks :) 👍
Awesome !!
Thanks
Very nice one. CAN you also please elaborate on live examples on each collection class. That's wud help us a lot
Sure Anupama 👍👍
@@CodeDecode Thaks much for the reply. Please make a video on recat and angula part also.
Quite useful info👍
Thanks 🙏
nicely done
Thanks!
Thanks for the video, really helpful 👍
You are welcome neeraj...
Thank you. Keep it up.
You're welcome ankush
Very nicely explained ..
Thanks
You forgot top interface Iterable, please update collection hierarchy if possible or add comment. Thanks for video, waiting for next!
Question: If the key of Hashmap is Immutable Object(properly create by developer with no mistake or let's say it's String class object) then do we need to override hashcode() and equals()? Or having immutable field as key solves the problem of overriding hashcode() and equals()?
Yes you have to.
Immutability does not make sure that your equal objects are stored at same bucket location. Hash code does. Interviewer is just trying to trick you.
@@CodeDecode thank you!
Great explanation!
Thanks..
18:44 Madam i think you are referring to Hashtable(thread-safe).....But by mistake it's written HashMap in this note.
so nice love it
Thanks 🙂👍
Wow great mam thanks for this amazing video🔥
👍👍
Your video helps me a lot for preparation of interview. Do you have any the text tutorial also for it?