Your question is Trade-offs in Data Structures. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Explain the trade-offs between different data structures when implementing a high-throughput system.
Discuss how access patterns, time complexity, memory layout, cache locality, allocation behavior, concurrency, and contention affect the choice between arrays, linked lists, hash tables, trees, heaps, queues, and concurrent data structures. Use at least one concrete workload to justify a choice rather than listing asymptotic complexities. The interviewer is checking whether you can connect abstract data-structure properties to latency, throughput, memory usage, and scalability.
Scope: standard data structures and concurrent implementations in a systems programming language such as C++, Java, or Rust.