Arrays and Dynamic Arrays Questions

Cover fundamental concepts and common techniques for using arrays and dynamic arrays. Topics include index based access, iteration strategies, insertion and deletion trade offs, dynamic resizing strategies and amortized cost analysis, memory layout and cache locality, two pointer and sliding window techniques, common sorting and searching patterns, and when arrays are the right abstraction. Candidates should be able to reason about time and space complexity and propose efficient in place solutions where appropriate.