How does a list differ from an array?

List — an ordered collection of elements that allows duplicates. The size of the list can change dynamically. It is usually implemented based on an array or a linked list.

Array — a fixed-size data structure that stores a sequence of elements of the same type in contiguous memory cells. Access to elements is done by index. The size of the array is determined at creation and cannot be changed afterward.

Main differences:

• Size: Array has a fixed size, list is dynamic.
• Performance: Access to elements by index is faster in an array (O(1)). Adding/removing elements in the middle of a list can be slower (O(n) for ArrayList, O(1) for LinkedList depending on the operation).
• Flexibility: Lists provide a wider set of methods for working with the collection (adding, removing, searching).