What are the differences between an array and a linked list?

Question

Accepted Answer

Arrays are fixed-size, contiguous memory structures; linked lists are dynamic, node-based structures with pointers.

Memory Allocation: Arrays have a fixed size, while linked lists can grow and shrink dynamically.
Access Time: Arrays allow O(1) access time for elements, whereas linked lists require O(n) time for access.
Insertion/Deletion: Inserting or deleting elements in arrays can be costly (O(n)), while linked lists allow O(1) operations if the node is known.
Example: An array of strings could be ['apple', 'banana', 'cherry'], while a linked list might consist of nodes containing 'apple' -> 'banana' -> 'cherry'.

Interview Questions from Popular Companies