Internal implementation is not clear

In this lecture, it is described that hashmap internally uses the array of buckets, and then it is told that linked list is used…

it all is very confusing…
please explain clearly or share a link/article where it is very clear…first go through it yourself also,before sharing

hey @kavit Just keep it clear That BucketArray is Always an Array not ArrayList not LinkedList always an Array. But Inside this BucketArray(Array) we can only use Dynamic Data structure(Whose size can be change and are not fixed) So we have two options available for this an ArrayList Or a LinkedList.You can use any of the the two above an ArrayList Or linkedList. For beginner friendly approach the mentor said that you can use ArrayList but Using arrayList the complexity for removing and adding will be large. So to Remove that problem java uses linkedList to Store data in every element of a bucketArray.

Thank you, I will try to check in a similar situation… I think it should work :slight_smile: