Linked lists are superior to arrays in the following ways:
Unlike arrays, which cannot have their size expanded at runtime, linked lists can.
If contiguous space is not available, nodes can be stored anywhere in memory and connected by a link, allowing a linked list to reside in main memory without having to be contiguous.
While arrays are statically stored in main memory and their size must be stated at compile time, linked lists are dynamically stored in main memory and increase in response to program needs.
While the number of elements in an array is constrained by the size of the array, the number of elements in a linked list is constrained by the amount of RAM that is available.