Java Collections | Collections Framework in Java | Java Tutorial For Beginners | Edureka
Video Title: Java Collections | Collections Framework in Java | Java Tutorial For Beginners | Edureka
Hello friends a very warm welcome this is ishan on behalf of edurika so guys uh this time we will be working with collections framework as in our tutorials so let’s see what and all we gonna cover for the day so we’ll understand what is Java’s collection framework we’ll see the hierarchy or the
Relationships between various apis in the collections framework we have a quick introduction to interfaces because in collections framework we have many interfaces will see a demonstration on list q and set for the day so these are the three different data structures as well so how we’re gonna structure the data in list q
And set so there are fundamental classes with the help of which we can create these data structures so we’ll see now how we can implement collections framework in our Java applications so to begin with the Java collection framework guys so uh collections they are the containers that are going to
Group multiple items as a single unit you can consider them as a multi-value container so they are Dynamic containers so you can add remove data dynamically that is at runtime so collections framework is an architecture where we can store and manipulate the group of objects so if you are implementing Java
Collections right so we can use the built-in functionalities to search the data sort the data you see manipulation like insertion or deletion so we can do lot of operations which are built in for us so the traditional data structures you need to write the EPS yourself but
Here you get the methods which can do the tasks for you and that too effectively and efficiently so Java collection framework will provide us interfaces and classes in order to you know store the data so Java Collections framework hierarchy is set of apis linked to each other as parent-child
Relationship so now let us try to explore that so collection framework hierarchy is going to start with an interface called retrieval so a travel is the root interface so from where this collection if you see is inherited and from the collection we got list q and set so all
These are interfaces now from the list we have three fundamental classes rail is linked list and Vector yeah from the vector guys uh we do have one more implementation called stack so from the queue uh what we have is a priority queue so this sorts the data in the
Queue as well and from Q we got DQ That’s like double ended queue and we got a fundamental class called radq so in the set we got hash set and linked hash set so in the linking here so guys this is Implement so this Arrow over here the
Dotted Arrow it says implementation so these classes they Implement and this solid Arrow over here it will tell us about extension right so interface can inherit another interface so here stack is inherited from Vector that is the collections framework hierarchy so we either have this sorted set called
Preset which will sort the data for us now the way we got this list q and set as the data structures we do have something known as map so guys in the map we have hash map and hash table so we do have a sorted version of the
Map where we get tree map but for the today’s discussion we’re gonna focus on list q and set so what are interfaces in Java so guys interfaces in Java they are the rule books so there you write the methods which must be implemented by the Java objects as rules
So interfaces they are the reference types where they are similar to classes but contains only the abstract methods as rules so we got interfaces they cannot be instantiated neither you nor the runtime environment can create its object interfaces cannot create Constructor or Fields they can contain only abstract
Methods so if you write a class which is the structure of an object so you can Implement an interface right so implementation is just like let’s say traffic police they have rules now so do not cross the red light that’s a rule where the seat belt when you’re driving
The vehicle that’s a rule so these rules are supposed to be defined by us right so we are a helmet in case you are driving a two wheeler so this is a rule now but the definition of this rule I have to Define that whether I want a
Full face Helmet or a partial covering a helmet a red color helmet or a black color helmet so that has to be defined by me so rules are implemented so interface can extend multiple interfaces so we can create rule books from the existing rule groups so once we know interface so now coming
Back to the collections framework so guys iterator is one interface so iterator interface in the collection Frameworks will provide the facility of iterating the elements in a forward Direction so once you have a data structure for example let’s say list you got so many elements and now you are a
Iterate in this list so we got iterator which can help us to iterate in the forward Direction so there are methods has next next and remove which we can use then it table as an interface is a root interface to all the collection classes we just checked it in our
Previous slide right the collection interface along with all its subclasses will also implement the iterable interface so this interface it table is a root interface so everyone implements it so this guy will give us a method called iterator through which we will get the reference of the iterator and we
Can iterate in a forward Direction in any data structure collection is also an interface which is implemented by all the classes in the collection framework so as to achieve runtime polymorphism so the methods like add all clear and many more methods the similar methods you will find in various apis of the
Collections framework now we’ll start with the data structures or the collections uh first topic called list so guys what is the list so list is something which extends collections framework and it stores the elements in an indexed approach and we can even add duplicate elements so list supports
Redundancy so there are three types of lists right we got arraylist linked list and Vector so guys arraylist linked list and Vector they are the fundamental classes which implements list interface all right so what are these three classes and what is the difference between them so arraylist is implementation of list interface where
We can dynamically add or remove the data so here what happens the data which is added is added in an index approach so we got indexing for the elements which you store in the RLS right so the next element will be added on the index
6 if you have already 0 to 5 occupied with sub elements so and so forth this arraylist will go on guys till the end so if you want to create an arraylist you need to write an arraylist object by saying a new arraylist and RLS class is going to have various methods for
Example add to add any element we got clear which will clear all the elements from the arraylist we got index of last index of two array trim to size many more methods in the same class arraylist so this belongs to the java.util package and it implements the list interface so
The way we got arraylist we have linked list so late list is a sequence of links so the data storage or the data structure here we have reference to the other link so we create a linked list by saying linked list object is a new linked list and there are two
Different types of linked lists we can Implement as in a singly linked list or a doubly linked list so what is the difference now in a singly linked list each node in the list will store the data of the node and the pointer or reference to the next node so let us
Have a you know view here so we’ll begin from the head which will be pointing to a node so node can have the data and the reference to the next node and we keep on moving till we get the null in the m w linked list is where we have two
References so one as in the next node other one as in the previous node right so node contains the data next node points to the next node and previous as a pointer or a reference will point to the previous row so that’s like how we got a doubly linked list we even have
More versions to the linked list but these are the two versions available here so the various methods in the linked list so guys they will have common methods so all the uh you know these classes arraylist linked lists and Vector they will have all the common methods
Now Vector is the third you know API which implements the list interface so this is again a class which is similar to arraylist the difference is that it is synchronized it means it is thread safe so earliest and Vector they are exactly same so even they store the data
In the same way in the index approach right and the difference is that Vector is a synchronized version of RNA it’s a thread safe version of arraylist so guys Vector will also have the similar methods so now what I’m going to do is I’m going to demonstrate you guys what
Is an arraylist over a practical example so what I’m gonna do is I’m gonna write a new Java project so let’s say a new Java project so I’ll leave it as collections so in the SRC I’ll do right click and see a new class and I’m going to name it
As list demo with the main method let us write the package go dot educa so how are we going to create a list so we will say arraylist from the java.util package so you can mention the type of data which you want to store for example here
I have mentioned the type of data which we are going to store is strain so list one can only store string objects so whereas if you want you can remove this type so this becomes uh more of generic now in a way that you can store any type of
Data so list two can store any type of object so let us see how so the first operation is add data in list so I can say this one dot add so you use the method Act so we’ll add John that says some more records Jenny Jim Jack Joe so I’m storing this
John twice so you see duplicacy now I won’t be able to store any other type here so I won’t be able to store a number 10 I won’t be able to store a number 2.2 so this will be error so why we will not be able to store
These values because list one over here is strictly a string data type so data which is being added is indexed one we got two three four and five so data whichever you are adding in the list is index now in the list two you can add
Any type of data so you can add John you can add number 10 you can add 2.2 so considering that we have a class called student right so let’s say there is a rule number and a name so I have these student objects student S1 is a new student where s1’s rule
Number is 1 1 and S1 name is let’s say Mike so you can even uh come here and say list two dot add S1 so in the list two we can add any type of data right so here we are type specific so here we can add any type of data
So now let us try to come here and print reference to list so I’ll say print out list one is plus list one and same way printing out list two is plus list two so run this code here as Java application so what you see is the first list
Contains John Jenny Jim Jack John and Joe whereas the second list contains John 10 2.2 2.2 so I think we added this 2.2 twice so what I can do is I can add a character here let’s say an a so we got this hash code for the student
Object right when we added S1 so it is printing me the hash code so this is printing all the elements in the list printing reference to the list shell print elements in the list the way we add it in a sequence now what if you want to get the element
From list so guys I will say string name is list one dot get on the basis of two so on the index two we got gym right so I’ll say CSO name is plus the name same way if you want to get the element
From list to so I can say object o is list two dot get on the basis of two now why I’m using object because object is the parent of any type in Java so as per polymorphism parent can point to any object so let us say C show O is plus o
So we don’t know the type here right so there is no specific type so that’s why we have kept the object here so when I run this code so you get to see the data so that is how we can get the element from the list so there can be an operation called
Update element in list so guys I can say list one dot set the second index now is let’s see Fiona and if you now reprint the list one list one now is plus list one the second index so that’s like 0 1 and 2 is now updated with Fiona the
Previous value was gym so gym updated to Fiona so if you want to remove the element so you just say list one dot remove the number two and now you say list one after delete is or after removes list one so this was the previous list with Fiona and now in
The new list you can see that Fiona is gone if you wanna just remove all you can simply say clear which is going to remove all so there are you know methods which can help us to perform searching and sorting as well so let me give you
An example so if list one dot contains John so I’m going to come here and see John is in the list so contains is going to do a search for me it says John is in the list so you see we got apis to perform the actions of our choice we
Need not to write the code ourselves so API is gonna do the job for us now the next operation is where we gonna iterate in rnas so there are various ways to do it but I’ll say for so we are going to use enhanced Loop for string Str in list one
I’ll simply say print out the Str so you run the code here you get to see the entire data so I’m just gonna say see so iterating with enhanced for Loop so here we are now when you run the code so iterating with enhanced for Loop so
You can even iterate with a basic formula right so a basic for Loop shall be like this so you will start from 0 you go till list one dot size and I plus plus so size method will give you the size so I’ll just say list one dot get
On the basis of I iterating with a basic volume so twice is yours so whatever the way you wanna iterate you can iterate so on the basis of indexes or using enhanced for Loop now there is an API called iterator so using an iterator API we are going to iterate so iterating
With iterator so let’s see how so you will say iterator of type string let’s say ITR is list one dot iterator so iterator method in the arraylist will give us a reference to the iterator and now I can simply say print out ITR dot next so
I’ll print out ITR dot next two times now when I will run this code so you see it gives me John and Jenny so when you do it or dot next again so it’s gonna give me John Jenny and Jack so next method gives me the next element so it’s
Not like iterating in a loop directly so iterator is going to give me the elements one by one whenever I call the method next so if you wanna use iterator and read all the elements I can go and check while ITR dot has next so I’ll see string Str is IPR dot next
And will print out the same SDR so this way we are going to iterate in the entire arraylist using iterator in a loop if you don’t want to use Loop you just keep on going one by one so iterator can also remove the element so I’ll say if Str dot equals let’s say
Jack so I’ll say ITR dot remove and lastly so now when I’ll say list one after iteration is plus list one you run this code it so what you see is we got this guy Jack but from the list Jack is removed so we can use remove method in
The iterator API to even uh Delete the element from the arraylist now the way you got this RLS implementation in the same way we have a linked list and Vector right so this is a quick introduction to how you can use RLS so now the next data structure on our list
Is Q so guys Java Q over here is supposed to work on first in first out approach and other than this it’s gonna sort the data for us so Java Q is working on first in first out so the element which is added first will be removed uh first and the last element
Will be removed in the last so we can use q and now we will have one of the implementations of the queue so guys so we got front and the rear so front will be removed first and rear will be removing the end so we have various methods again available in the
Queue so we got add remove we got peaking and pulling right so we’ll see how we can do this speaking and pulling in the queue so let’s have one introduction practical introduction to the queue so I’ll write one more Java class so let us see this is Q demo with the main method
So to create a queue I’ll create a class called priority key so we got priority queue and I will take integer numbers as uh the elements in the queue so this is priority queue guys right and what I’m going to do is I’ll create a loop which starts from 10 and goes till
Greater than 0 and will keep on decrementing the loop so here I will say Q dot add I so how we are adding the data over here so we are adding the data in the queue so let me show you so Q is
Like this 10 9 8 7 6 5 4 3 2 and 1 which means that 10 is added first right so this guy is the front and one is added in the end so this guy becomes the rear so 10 is added firstly and one is added lastly but now priority queue
Sorts the data for us so priority queue will be sorting the data for us now when priority queue will sort the data so priority queue will make the queue to go like this so when the Sorting will happen so one will become front and 10 will
Become rare so this is the actual queue right so this is sorted queue the actual one now there are two major operations so the first operation is beating so peaking is obtaining the head of Q and the second operation is Colin which is we are going to up so here we will remove
The head of Q so uh let me come here and say print me Q dot P so what is this speaking so speaking is head of Cube and who is the end of Q guys the end of Q is the number one because the queue is sorted so now
When you run the code here as Java application what you see is the number one now what I’ll do is I’ll come here and see let us do a poll operation so what is pool pool is removing the head right so pole will remove the head so in
The next instruction if I’ll do the PK so the new head of the Q is two so removing the head one so now when you run the code you see that it is giving me two so that’s like the new head so if I come here and
Yeah so in the same example so I’ll just say Hue size is plus Q dot size and once you do a pole operation so Q PSI is after all is Q dot size so when you run this code there you see that the initial
Size was 10 and the element is one so I can just try to be more specific here so head of Q is plus this same way I’m gonna do like this so after the pole the size remain 9 and who is pulled head is removed and the new head of the queue is
Two so that is what we got peaking and pulling in the queue so guys Q is first in first out so what has happened over here so whatever the element you added in the front that will be removed first so that is one quick introduction to Priority queue which even sorts the data
For us now the next data structure is set in Java so what is a set guys right set is again a collection but this focuses on uniqueness so in the list we can add duplicate elements but here in the set we cannot add duplicate elements
All right so guys set will focus on you know uniqueness so it’s gonna use hashing technique by which we will be having unique elements coming in so it is mainly to model the mathematical set abstraction Now set as various classes so we got three fundamental structures
For the set we got hash set link hash set and the tree set now what is Hash set guys so hash set will create a collection that will use hashing to store the objects so hash set will contain only unique elements and it inherits an abstract set class and
Implements the set interface so as in when it comes to the hierarchy so what are the apis which it implements or inherits the next is it is going to use hashing mechanism to store the elements so guys what is hashing so we got a hash function which generates a hash code for
The element right so please you can just see to it explore it in case you are not aware of what is hashing so we’ll create a hash set object as a new hash set and the link so hashtag will have the similar methods will have ADD remove
Contain size iterator will do lot of stuff in the hash set again we’ll see a practical implementation of course guys for the hash set now in the link I said right so uh this is again a class right which is going to be a hash table and linked list implement station so it’s
It’s gonna be a linked headset so it will again contain unique elements so it’s gonna provide all the optional set operations and maintains insertion order so link I said will maintain how the data is getting inserted for us the hash set will not be able to do that so it’s
Gonna give us the random or the unordered output so this is how you create an object of Link asset and this class inherit methods from the other classes so we got hash set abstract set abstract collection object and set so these are some more of the classes now
Preset is a sorted version of your set right so whatever the data we’re gonna add this will be unique and it will be sorted in the ascending order for us so that is taken care automatically when you implement a preset so guys when we are talking about preset it inherits
Abstract set and implements navigable set interface when it comes to the hierarchy so preset can be created like this so let us have an introduction to the preset and the hash set so guys preset will have the similar methods available right so all those contains remove add this that Etc and Etc
So let us come and see one practical implementation on sets so I will write a new class so I’m gonna name it as set demo with the main method so we’ll create a hash set so I’ll maintain the type here as string set is a new hash set
So we’ll add the data the way we were adding in the list so we’ll say John let’s say Jenny Jim Jack John and Joe so what we see is John is added three times so it is duplicated Thrice and the data which is being added
Is not indexed right so here data is not added as in indexing approach so we got hash codes for Elements which are being added so now here when I try to list the data in the set so I’ll say set is plus set so printing a reference
So what you see is that John is added only once not Thrice so duplicacy is removed that’s the first point the second thing is output is unordered now the reason why output is unordered is because of hashing right so for the set there are two observations number one data is unique
No redundancy number two observation is where data is unordered in output due to hashing now when you are supposed to iterate in this guy we cannot use Loop right so there is nothing like indexes here for us that we can iterate but anytime you can use this structure called iterator
So you say ITR is set Dot iterator we can say while ITR dot has next string name let’s just string as R is IDR dot next and you print out the string so hashing technique will uh not allow us to have indexes so we can iterate using an iterator so Joe John
Jack Jenny and Jim data is stored as hash table here so with the hashing so guys uh we do have other apis here so you can anytime come and say set dot remove the element gym you can say if set dot contains John is in the set so there are various apis
Right which you can actually explore so set size is plus set dot size so these are the common methods in all the data structures so after removing I’ll say set after removing gym is plus the set so let us run this code and see some more API so it says
Set after removing Jim is Joe John Jack and Jenny so you see Jim is removed so John is in the set and the size of the set is four so guys the way we have this hash set which focuses on uniqueness we can create a preset so I can write a tree set
So preset shall focus on sorting right so data is unordered but it is alphabetically sorted so the data will be sorted now if I run the same code here so what I will see is that so we got the data coming as Jack Jenny Jim Joe and John so guys this
Is alphabetically sorted so what I can do is I can add few uh names with different alphabets so let’s see I’m gonna say Albert somewhere here I’m gonna see Becca and let’s see Kevin so when you run this code here so what you see is you got the
Data coming as in the sorted Arrangement so all these JS they’re also sorted now the performance of the tree set is a bit low as compared to Hash set because this guy will take an additional time to sort the data as well right so guys preset is a sorted version of hash set
So this is what we got for the day so I hope you have enjoyed the session so guys thank you so very much once again this is ishan on behalf of edurika so do like our Facebook page and do subscribe to our YouTube channel thank you guys
Bye bye have a wonderful time ahead I hope you have enjoyed listening to this video please be kind enough to like it and you can comment any of your doubts and queries and we will reply them at the earliest do look out for more videos in our playlist And subscribe to edureka
Channel to learn more happy learning
-
Sale!
Wireless WIFI Repeater Extender Amplifier Booster 300Mbps
$29.99$14.99 Add to cartWireless WIFI Repeater Extender Amplifier Booster 300Mbps
Categories: Electronics, Wi-Fi Router, Wireless Wi-Fi Extender Tags: 300Mbps, 802.11N, Amplifier, Booster, Extender, mobile wi-fi booster, Remote, WIFI, Wireless, Wireless WIFI, Wireless WIFI Repeater, Wireless WIFI Repeater Extender, Wireless WIFI Repeater Extender Amplifier, Wireless WIFI Repeater Extender Amplifier Booster, Wireless WIFI Repeater Extender Amplifier Booster 300Mbps$29.99$14.99 -
Sale!
Full RGB Light Design Gaming Headset Headphones with Mic
$24.99$14.99 Add to cartFull RGB Light Design Gaming Headset Headphones with Mic
Categories: Electronics, Gaming, Gaming Headsets Tags: Design, Full, Full RGB Light Design Gaming Headset, Full RGB Light Design Gaming Headset Headphones, Full RGB Light Design Gaming Headset Headphones with Mic, Gamer, Gaming, Gaming Headset Headphones, gaming headset wireless, Headphone, Headphones, Headset, Light, Mic, Package, RGB$24.99$14.99 -
Sale!
Wireless BlueTooth Multi-Device Keyboard Mouse Combo
$39.99$19.99 Add to cartWireless BlueTooth Multi-Device Keyboard Mouse Combo
Categories: Electronics, Gaming, Gaming Keyboards, Keyboard Mouse Combos Tags: Combo, Keyboard, keyboard mouse combos, Mouse, MultiDevice, Set, WireKeyboard Mouse Combo, Wireless, Wireless BlueTooth Keyboard Mouse Combo, Wireless BlueTooth Keyboard Mouse Combos, Wireless BlueTooth Multi-Device Keyboard Mouse Combo, Wireless BlueTooth Multi-Device Keyboard Mouse Combos$39.99$19.99 -
Sale!
High Back Leather Executive Adjustable Swivel Gaming Chair with Headrest and Lumbar
$199.99$139.99 Add to cartHigh Back Leather Executive Adjustable Swivel Gaming Chair with Headrest and Lumbar
Categories: Gaming, Gaming Chairs Tags: Adjustable, Chair, computer chairs, Desk, Executive, Gaming, Girl, Headrest, High, High Back Leather Executive Adjustable Swivel Gaming Chair, High Back Leather Executive Adjustable Swivel Gaming Chair with Headrest, High Back Leather Executive Adjustable Swivel Gaming Chair with Headrest and Lumbar, High Back Leather Executive Adjustable Swivel Gaming Chairs, Leather, Lumbar, Office, Racing, Swivel$199.99$139.99 -
Sale!
Professional LED Light Wired Gaming Headphones with Noise Cancelling Microphone
$29.99$19.99 Select optionsProfessional LED Light Wired Gaming Headphones with Noise Cancelling Microphone
SKU: N/A Categories: Electronics, Gaming, Gaming Headsets Tags: Cancelling, Gaming, Gaming Headphones with Noise Cancelling Microphone, gaming headset, Headphones, Headset, LED, Light, Mic, Microphone, Noise, Professional, Professional LED Light Wired Gaming Headphones, Professional LED Light Wired Gaming Headphones with Noise Cancelling Microphone, Wired, Wired Gaming Headphones, Wired Gaming Headphones with Noise Cancelling Microphone$29.99$19.99 -
Sale!
Gaming Desk with LED Lights USB Power Outlets and Charging Ports
$349.99$249.99 Select optionsGaming Desk with LED Lights USB Power Outlets and Charging Ports
SKU: N/A Categories: Computer Desk, Gaming, Gaming Desk Tags: and Charging Ports, Charging, Desk, Desks, Gaming, gaming desk with led lights, Gaming Desks with LED Lights, Home, LED, Lights, Monitor, Office, Outlets, Port, Power, Room, Stand, USB, USB Power Outlets, White, Workstation$349.99$249.99 -
Sale!
Wired Mixed Backlit Anti-Ghosting Gaming Keyboard
$99.99$79.99 Add to cartWired Mixed Backlit Anti-Ghosting Gaming Keyboard
Categories: Electronics, Gaming, Gaming Keyboards Tags: Antighosting, Backlit, Blue, brown, Gaming, Gaming Keyboard, gaming keyboards, gaming keyboards and mouse, Keyboard, Laptop, Switch, Wired, Wired Mixed Backlit Anti-Ghosting Gaming Keyboard, Wired Mixed Backlit Anti-Ghosting Gaming Keyboards, Wired Mixed Backlit Gaming Keyboard$99.99$79.99 -
Sale!
Wireless Bluetooth 5.3 ANC Noise Cancellation Hi-Res Over the Ear Headphones Headset
$119.99$59.99 Add to cartWireless Bluetooth 5.3 ANC Noise Cancellation Hi-Res Over the Ear Headphones Headset
Categories: Electronics, Gaming, Gaming Headsets Tags: 5.3 ANC Noise Cancellation Hi-Res Over the Ear Headphones Headset, ANC, Audio, Bluetooth, Cancellation, Ear, Earphone, gaming headset, Headphones, Headset, Hi-Res Over the Ear Headphones Headset, HiRes, Noise, Wireless, Wireless Bluetooth 5.3 ANC Noise Cancellation Hi-Res Headphones, Wireless Bluetooth 5.3 ANC Noise Cancellation Hi-Res Over the Ear Headphones Headset, Wireless Bluetooth 5.3 ANC Noise Cancellation Hi-Res Over the Ear Headphones Headsets$119.99$59.99 -
Sale!
Wired Sports Gaming Headset Earbuds with Microphone
$19.99$9.99 Select optionsWired Sports Gaming Headset Earbuds with Microphone
SKU: N/A Categories: Gaming, Gaming Headsets Tags: Accessories, Earbud, Earphone, Earphones, Gaming, gaming headset with microphone, Headphones, Headset, IOS, Microphone, Sports, Wired, Wired Sports Gaming Headset Earbuds, Wired Sports Gaming Headset Earbuds with Microphone, Wired Sports Headset Earbuds$19.99$9.99 -
Sale!
150W Universal Multi USB Fast Charger 16 Port MAX Charging Station
$49.99$29.99 Add to cart150W Universal Multi USB Fast Charger 16 Port MAX Charging Station
Categories: Charging Stations, Electronics Tags: 150W, 150W Charging Station, 150W Universal Multi USB Charging Station, 150W Universal Multi USB Fast Charger 16 Port MAX Charging Station, 150W Universal Multi USB Fast Charger 16 Port MAX Charging Stations, 150W Universal Multi USB MAX Charging Station, 16 Port MAX Charging Station, 3.5A, Charger, Charging, Fast, laptop charging stations, Max, Multi, Port, Stand, Station, Universal, USB$49.99$29.99
crisp & clear teaching . 😍
thank you
Great Video! I am glad I found it, well explained
Thank you!
Great video!Helped a lot!! 😍🥰
Thanks, nice to find your Chanel.
Thank you this help me a lot 🥰♥
The set up to each slide is amazing. I understood everything thanks to your clear explanations!
i really enjoyed the session, thanks you
Clean explanation and well organized, love the session….
Thanks, man. Very educative
Awesome video! This cleared up a lot of things ^^
Thank you.
thanks very much man best wishes
Dudeeee…. Awesome explanation..
Wow great explanation 🥺 🥺
The graphics used to explain concepts are excellent.
Very good breakdown, thanks.
1:20 – Collection Framework / Collection Framework Hierarchy
4:30 – Interface
7:41 – java Lists
12:00 – ArrayList Demo
22:20 – Queue
28:00 – Set
thanks a lot
Great tutorial!
Very well explained. Thank you
thank you sir for the course. i got a lot from it
Good explanation
Wow!!! What a wonderful presentation? Straight to the point, precise, concise, and yet uniquely elaborate…haaha. The Collection FrameWork so summarized. Thumbs up.
great! thak you!
awesome video
Way of explaining is awesome.
Very simple Explanation, thanks edureka.
I recommend Edureka to everyone. He tells it only once with really nice and clear explanations.
amazingly explained. thank you so much
Amazing Explanation – Even Bigger Platforms like "Pluralsight" lack that kind of simple and pinpoint explanation….
Thank you Edureka for providing free material of high quality. Really appreciate your efforts.
TOP NOTCH!
good for review data structure
I love your channel, good information and well explained.
Nice Explanation! Edureka's instructors are always best at teaching any concepts.
You guys are doing a really great job by explaining each and every concept with a practical and hands-on approach.
Awesome NIshant
Thank you @Eshan , Your way of explaining is really awesome which helps any one to understand the concept very easy and programmatically .
Very good and clean explanation
thank you so much Ishaan Bro. U explained really well, i have understood now.
excellent……requires little deapth
it's nice, but improvement is need more practical stuff.
Thanks for the video Eshan and Eureka. Very helpful!
Good tut. Thank you.
The Best Video Ever Seen on Java Collection
Thanks a lot
Lots of doubt has been cleared after watching this video 🙂👍