Answer
List uses a dynamically resizing array. When full, it grows and copies elements.
Provides fast indexing but costly mid-list insertions.
Quick Answer
List internally uses an array. When it runs out of space, it allocates a new array twice the size and copies everything over. This gives O(1) average Add() and O(1) indexed access, but O(n) insertion or removal in the middle. It is the go-to collection for most scenarios.
S
SugharaIQ Editorial Team
Verified Answer
This answer has been peer-reviewed by industry experts holding senior engineering roles to ensure technical accuracy and relevance for modern interview standards.
Want to bookmark, take notes, or join discussions?
Sign in to access all features and personalize your learning experience.
Source: SugharaIQ