The items of an array list are internally stored in a dynamic array. To store its elements, LinkedList makes use of a Doubly Linked List. Because manipulating an array takes longer, ArrayList is slow. Because it is node-based and requires less bit shifting, LinkedList is faster.