The document compares array-based lists and linked lists. Array-based lists use arrays internally, making accessing elements easy but slowing manipulation. Linked lists use a double linked list internally, making manipulation very fast but requiring more memory. Array-based lists implement dynamic arrays while linked lists implement both lists and queues through interfaces.

1. What are the differences between an array-based list and a linked list data structure? What are
the advantages and disadvantages of both types of lists in comparison to each other?
Solution
Array Based List:
Array List implements dynamic array based. So it is very easy to storing and accessing the
elements from that list. But manipulation with ArrayList is slow becuase they use arrays
internally.
ArrayList acts like a List becuase it implements List Inteface.
LinkedList:
Linked List uses double linked list internally for storing elements in it. Manipulations are very
fase than arraylist because it uses double linked list. So no need to shift the elements in memory.
LinekedList acts like a List and queue becuase it implements List & Deque Inteface.