How do you think about cache locality in C++?
PICTURE THIS: ARRAY IN MEMORY
Index starts at 0. Scan once for max — O(n).
Simple meaning
Sequential vector access beats pointer chasing in a list or tree.
WHY — Performance instead of guessing?
Why interviewers care about Performance:
question about Performance.
trade-offs, and what you would actually do on a C++ project - not buzzwords.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1Sequential vector access beats
pointer chasing in a list or tree.
- 2I structure data as
arrays of structs or SoA depending on the hot loop.
- 3How it works
Profiling beats rewriting for cleverness.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
Sequential vector access beats pointer chasing in a list or tree. I structure data as arrays of structs or SoA depending on the hot loop.