Difference between Linkedlist vs arraylist

 Java Linked List vs Arraylist

What is difference between linked list and arraylist in java and where to use it

In Java, an ArrayList is a resizable array implementation of the List interface. It allows you to store a large number of elements efficiently, while providing many of the same features as a linked list.

One major difference between a LinkedList and an ArrayList is the way they store their elements. A LinkedList stores its elements in a series of nodes, where each node contains a reference to the next and previous element in the list. An ArrayList, on the other hand, stores its elements in a contiguous block of memory, which means that the elements are stored in a linear fashion and can be accessed using an index.

One advantage of using an ArrayList is that it has faster access to elements using an index, compared to a LinkedList. This is because an ArrayList stores its elements in a contiguous block of memory, so it is faster to access an element at a specific index.

On the other hand, a LinkedList has some advantages over an ArrayList. For example, inserting or deleting an element from the middle of a LinkedList is faster than with an ArrayList, because it does not require shifting all of the elements after the insertion or deletion point.

In general, you should use an ArrayList when you need fast access to the elements using an index, and you do not need to perform many insertions or deletions. You should use a LinkedList when you need to perform many insertions or deletions, but do not need fast access to the elements using an index.