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 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
This is my first ever RUclips 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.
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.
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
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..❤❤
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.
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?
@@shouryapradhan184 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 ?
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.
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?
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..
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.
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.
Thanks . Please do the video showing the internal implementation of HashSet as well and also tell the info like in which scenario which kind of Collection is the suitable one to use
6:50 Hashtable isn't implemented Hashset, it's "Hash Table" in the code of Hashmap. please check and correct. I got confused when I watched first. If i interpreted wrongly, Please let me know your thoughts.
Thanks for the awesome video. However, 18:40 you mentioned HashMap is slower as compared to its respective concurrent counterparts. But that's not true as HashMap is non-synchronized faster. Please correct me if I am wrong
Thanks for writing back to us Parul . We hope u land at your dream job soon. All the very best from team code decode, for your interviews. Keep learning keep growing.
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
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
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 🙂👍
Great Explanation!!!
One more point: Hashtable doesn’t extend Hashmap.
It extends Dictionary Class.
👍👍
This is my first ever RUclips 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 🙂👍
Thanks a lot.. The best Collection summary available on YT.
Best i have seen before the way ur explaining very well thank you
you're welcome venkat
It enhanced my knowledge for sure. Thanks.
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.
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
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
Seriously very great explanation ❤️
Thanks a lot 🙂🙂👍👍
Everything explained to the point!! Thank you for making great videos
Thanks Savita 👍
The way you explaining each topic is awesome.
Thank you for the amazing video.
Thanks for the nice words.....
Really very good explanation.
We are lucky to watch this.
Thanks Vinod 👍
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 ⭐✨⭐✨
Thank you, nice explanation of all collections, mostly I like internal working of hash map, got the more clarity….
ruclips.net/video/7k0VYHuUF6g/видео.html
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 🙂🙂
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..❤❤
Very clear explanation.. and provide example code 👍👍👍👍
Thanks Siva 👍👍
5 lakh 48 thousand + views
Congrats 🎉🎉🎉
Thanks Rishi for your constant support
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.
Yes this is literally most asked and top questions. Thanks.
Thanks
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
Hats off very nicely explained and your presentation is also too good.
Thanks 👍
Thank you mam .....your way of talking/understanding.....love it
You're welcome kamal.....
❤
very clear and crisp explaination 💥
Thanks Shubham 🙂👍
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.
Very good questions and their detailed explanation. Thanks 👍👍
Thanks for the nice words...
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?
@@shouryapradhan184 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 ?
Nice explanation friend thank you very much for sharing.
Thanks for the nice words 👍
Very good explanation of Internal working of hashmap. Liked it.
Thanks
Very good. Explanation. Thank You 😊
Thanks 🙏
Good one mam,please continue such videos.
sure we will upload more
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 🙂🙂
Such helpful content and appreciate your hardwork Thank you mam!!
Thanks Manoj 🙂👍
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 nice but need more questions from collections with demonistration
Sure we will create soon
Thank you once again for explaiing clearly
Thanks Chisha Malama 🙂🙂👍👍
Excellent videos, Thank you so much!
Thanks Nidhi 🙂👍
Thanks for wonderful explanation 🤝
You are welcome
Thank you for a very detailed explanation. :) Expecting more videos like this.
Sure Shamil. We will upload more videos on collection framework
Thank you so much , I found all my interviews questions from there...We need people like you!
Thanks for nice words chandan
Nice work...one mistake is map interface doesnt extends(not implement) Collection interface
Nice explanation,you are doing a great job. Thank You
Thanks Bhushan 👍👍
Awesome video for java collections 💯💯💯
Thanks sakshi 👍
4:42 small correction, I think Linkedlist do allow index base search
Each and every video is so informative!! Love your content ❤️..
thanks kaushiki
Thank you so much, madam. You explained in-depth and very nicely
Thanks 👍👍
Very Well Explained.
Thanks Ammar 🙂👍
thank you madem very good explanation 👌👌👌🙏
You are welcome
very nicely explained... eagerly waiting for Multi-threading concepts.. once again good job!
Thanks .......
Respect for your explanation ma'am...
Thanks 👍
Pleasr create more tricky questions on collections
sure sreeja we will create soon
Best study video for interview
Thanks 👍👍
Please make another video(part2)on collections tricky questions and include concepts like internal working of hash set
ruclips.net/p/PLyHJZXNdCXsfqAkteaQ6JfZ_IHvxX-Hj3
Very good to remember and recollect
Thanks Sanjeev 🙂👍
yes i would love to see internal working of hashSet
ruclips.net/video/7k0VYHuUF6g/видео.html
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 🙂👍
Thanks for the great video. Helped me a lot.
You're welcome
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 Explanation
Thanks......
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?
Very well explained! thank you
Thanks 👍👍
Thanks for the video, really helpful 👍
You are welcome neeraj...
Thanks.. that was awesome 👍
Thanks Sourabh 🙂👍
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
Nice video keep it up 👍
Thanks ☺️
Content is really usefull mam! If possible can you attach ppt document also with the video. It would help for quick recap
Please continue and create video for internal working of hashset as well.
Sure👍👍
Wow great explaination
Thanks 👍
OMG this is really what java developers are looking for
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 🙏👍👍👍👍
Gem 💎 👌👌👌👌👌
Thanks Nilesh 🙂🙂👍👍
Very nicely explained ..
Thanks
the video is very usefull . at 3.40 you interchangeably used implements and extends keyword . if possible correct that .
Wow great mam thanks for this amazing video🔥
👍👍
Thank you. Keep it up.
You're welcome ankush
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.
Thanks . Please do the video showing the internal implementation of HashSet as well and also tell the info like in which scenario which kind of Collection is the suitable one to use
Nice topic thanks 👍
For hashmap internal working, hashcode method is called by hash method of HashMap and hash method calculates index based on hashcode value
ruclips.net/video/7k0VYHuUF6g/видео.html
so nice love it
Thanks 🙂👍
6:50 Hashtable isn't implemented Hashset, it's "Hash Table" in the code of Hashmap. please check and correct.
I got confused when I watched first.
If i interpreted wrongly, Please let me know your thoughts.
Internally hash map uses hash table. Hash set internally uses hash map. So indirectly hash set uses hash table .
Quite useful info👍
Thanks 🙏
You forgot top interface Iterable, please update collection hierarchy if possible or add comment. Thanks for video, waiting for next!
Thanks for the awesome video. However, 18:40 you mentioned HashMap is slower as compared to its respective concurrent counterparts. But that's not true as HashMap is non-synchronized faster. Please correct me if I am wrong
Thanks its really helpful 😊
We are glad it's helpful. Thanks for writing back Ravi 👍
Thank you for the amazing video.. It helped me a lot for my interview.
Thanks for writing back to us Parul . We hope u land at your dream job soon. All the very best from team code decode, for your interviews. Keep learning keep growing.
Good video
Thanks
Great explanation!
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.
Good content
Thanks 👍👍
Awesome !!
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
@codedecode NavigableSet & NavigableMap interfaces are missed