You are a freaking legend! everything you said makes sense, your logic is very clear. you are the "go to guy" after my java class at school, you always make everything crystal clear and easy to understand. Thank you so much for your hard work.
Thank you so much sir. There cannot be a better way to teach these concepts. I wish i could get a teacher like you in my college. You are true gem sir and your lectures are truly phenomenal. I know thanks is not sufficient to express my gratitude towards your hard work and dedication. Though putting in words- Thank you sir for everything you are doing in this direction.🙏🙏🙏
Thankful and grateful for you sir for sharing your keen knowledge it was clear and concise the way you taught 👏 help many more people in future as well. I watched all your videos i got confident now in collection topic thank you once again sir!
Hello sir ,I am your biggest fan.I see all your videos ...its my daily duty to watch them and i learn many new things.I know i am being childish 😂please reply for my message also sir I will feel very much happy ...learnt manual testing on seeing your video sir..
During the 30:00-35:00 interval we have printed many times and each time we get the output in sequential manner. Is it the coincidence or we get actually in sequential manner because in the beginning of video u tell that the sequence is not maintained in a hash
Everything is good neat and clear sir, but this "retainsAll, containsAll, removeAll" methods are available for List Interface also, because they are part of Collection Interface(So Please add this as a Note in your video Sir so that it will be helpful for us also)..!!
Sir i have a question as you said 1. In case of ArrayList initial size is 10, when we are 11th element new ArrayList is created then what will be the size of new ArrayList, reason for asking is what will happen we try to insert 12th element into new arrayList, 12th element will be added into new arrayList or again new arrayList will be created 2. Same question what will be size of new Hashset when load factor has reached
Array list increase intialsize+half of its initial size. Suppose arraylist intial size 10 then 10+5(half of its initial size)=15 is the new size of arraylist. This is the difference between arraylist and vector. Vector increase the size double of its initial size means 10(intial size)+10(adding intial size)= 20(double of its initial size). Hashset also increase its double of its initial capacity when the 75% of intial capacity is filled.
Please correct your video at 43 minutes. retainAll will not give intersection. ex: set1 { 1,2,3,4,5} and set2 {3,4,5,6} then set.addall(set2) will make set1 as {1,2,3,4,5,6} but set1.retainall(set2) will give {3,4,5,6} which is not an intersection between 1st set1 and set2.
if you comment out the addAll code and try retainAll you will get the intersection result as shown in the video. retainAll() method retains from set1 all of its elements that are contained in the specified collection set2.
I wish I cud find you as a personal Java Trainer. I have never seen a teacher like you... You are priceless....
You are a freaking legend! everything you said makes sense, your logic is very clear. you are the "go to guy" after my java class at school, you always make everything crystal clear and easy to understand. Thank you so much for your hard work.
Great to hear!
Only thing i want from you now is the "GOATED" DSA playlist.
Thank you so much sir. There cannot be a better way to teach these concepts. I wish i could get a teacher like you in my college. You are true gem sir and your lectures are truly phenomenal. I know thanks is not sufficient to express my gratitude towards your hard work and dedication. Though putting in words- Thank you sir for everything you are doing in this direction.🙏🙏🙏
Excellent.. the Way you explained really super and appreciated...
Thanks
Sir thanks for providing understandable collection frame wrk good teaching
Thanks
Thankful and grateful for you sir for sharing your keen knowledge it was clear and concise the way you taught 👏 help many more people in future as well. I watched all your videos i got confident now in collection topic thank you once again sir!
It's my pleasure
Thankyou so much for your efforts(SIR❤)
It's my pleasure
Hello sir ,I am your biggest fan.I see all your videos ...its my daily duty to watch them and i learn many new things.I know i am being childish 😂please reply for my message also sir I will feel very much happy ...learnt manual testing on seeing your video sir..
please reply 🥺
Very good lecture sir , it was very understandable ❤️
Thanks
Thank u sir.ur teaching is so good .pls explain data structures and core java .
For us kindly request that you sir, please start the java+DSA course sir.
Thanks for the Vedios Pavan Sir
You are most welcome
Thanks for the tutorial!
My pleasure
Thanks. very wonderful way of teaching!
most welcome
Very Precise Explanation !!
Glad it was helpful!
Top Notch Content...🥳🥳🥳🥳
thanks
Just Amazing
Thanks
Sir...interviewres asking..mostly asking HashMap and Hash table, Hashset..
Wow amazing teacher you are..
Thanks
Thanks sir.
Most welcome
Excellent.
Thanks
Thank you! sir
During the 30:00-35:00 interval we have printed many times and each time we get the output in sequential manner.
Is it the coincidence or we get actually in sequential manner because in the beginning of video u tell that the sequence is not maintained in a hash
Thank you
Welcome
Everything is good neat and clear sir, but this "retainsAll, containsAll, removeAll" methods are available for List Interface also, because they are part of Collection Interface(So Please add this as a Note in your video Sir so that it will be helpful for us also)..!!
Thank you sir.
welcome
Excellent.....
Thanks
Thank you sir
Welcome
how come insertion order of the elements is preserved in Hashset? Everytime I print, it prints in same order as I inserted
Sir i have a question as you said
1. In case of ArrayList initial size is 10, when we are 11th element new ArrayList is created then what will be the size of new ArrayList, reason for asking is what will happen we try to insert 12th element into new arrayList, 12th element will be added into new arrayList or again new arrayList will be created
2. Same question what will be size of new Hashset when load factor has reached
Array list increase intialsize+half of its initial size. Suppose arraylist intial size 10 then 10+5(half of its initial size)=15 is the new size of arraylist.
This is the difference between arraylist and vector. Vector increase the size double of its initial size means 10(intial size)+10(adding intial size)= 20(double of its initial size).
Hashset also increase its double of its initial capacity when the 75% of intial capacity is filled.
@@saicharan4081 Thanks for the input
Thanks you so much sir
Most welcome
how to get the particular element from the data by using set interface
35:39 seconds out put the order in which u have entered in the same order v r getting
load factor for arraylist is 0.75
Thanks
Welcome
Please correct your video at 43 minutes. retainAll will not give intersection. ex: set1 { 1,2,3,4,5} and set2 {3,4,5,6} then set.addall(set2) will make set1 as {1,2,3,4,5,6} but set1.retainall(set2) will give {3,4,5,6} which is not an intersection between 1st set1 and set2.
if you comment out the addAll code and try retainAll you will get the intersection result as shown in the video. retainAll() method retains from set1 all of its elements that are contained in the specified collection set2.
If we need 100 data items . how we need to add everytime is we need to use the "add" keyword??
Yes...
U said hashset doesn't maintain any order but at 35 mits
Where is Stack implementation?
removeall and retainAll is not union and intersection
You have missed out a type "Sorted Set" here.
Hi sir plz provide pdf notes too sir 🙏