Loading page content
Free DSA visualization
Fixed-index storage with O(1) access — the foundation of most interview problems.
Step 1 of 3
Start with an array of five values.
Complexity: O(1) time · O(1) space
Interview ask: Why is array access O(1) while linked-list access is O(n)?