An array is a repeated pattern of variables in contiguous storage. A linked list is a set of structures scattered through memory, held together by pointers in each element that point to the next element. With an array, we can (on most architectures) move from one element to the next by adding a fixed constant to the integer value of the pointer. With a linked list, there is a “next” pointer in each structure which says what element comes next.
Array List is an implement of class which follows Array structure. Array List is faster in Accessing the elements and solver in insertion and Deletion.
Linked List is an implementation class of List interface which follows tree structure. Linked List is solver in Accessing the elements and faster in insertions and deletion.