Difference between array and linked list ? Arraylist and LinkedList in collection framework

Question

Accepted Answer

Array is a fixed-size data structure while linked list is a dynamic data structure. ArrayList and LinkedList are implementations of List interface in Java.

Array is a contiguous block of memory with fixed size, while linked list is a collection of nodes where each node points to the next node.
ArrayList in Java is implemented using an array, which can dynamically resize itself. LinkedList is implemented using nodes with references to the next and previous nodes.
Arrays are faster for accessing elements by index, while linked lists are faster for inserting and deleting elements in the middle of the list.
Example: String[] array = new String[5]; ArrayList arrayList = new ArrayList<>(); LinkedList linkedList = new LinkedList<>();

Difference between array and linked list ? Arraylist and LinkedList in collection framework

Top LinguaSol Junior Software Developer interview questions & answers

Popular interview questions of Junior Software Developer