Why does growing a vector by doubling keep pushes cheap?

A strong answer

A strong candidate frames Why does growing a vector by doubling keep pushes cheap? around the exact memory layout, compiler semantics, and hardware execution model covered in vector: The Default Container and How It Grows. Explain size versus capacity, doubling growth with linear total moves, and why pointers expire on reallocation.

std::vector is that class, finished: contiguous storage, doubling growth, full exception safety, and move-aware reallocation. Reach for it by default and reimplement it never, except to learn.

A vector is three words: a pointer to a heap block, a size (elements alive) and a capacity (slots allocated). The trace above walks the first reallocations: 0 to 1, 1 to 2, 2 to 4. Only the elements are copied; the vector object itself never moves.

In a production interview, always connect the specification rule to its concrete runtime consequence: state what lives on the stack versus the heap or static storage segment, how the compiler or operating system validates alignments, lifetimes, and error codes, and what happens under adversarial or boundary inputs (such as zero-length buffers, integer overflow, concurrent mutation, or partial I/O). Backing your explanation with a small trace of register/memory state transitions immediately separates senior systems engineers from candidates who only memorized syntax.

What the interviewer is listening for

• Mastery of core invariant: Explain why vector storage is contiguous and what that buys.
• Mastery of core invariant: Predict when push_back reallocates and what happens to iterators.
• Mastery of core invariant: Use reserve, size, capacity and shrink_to_fit correctly.
• Hardware and ABI awareness: Explaining how sizes, alignments, calling conventions, or kernel boundaries behave on real 64-bit targets rather than relying on implementation-defined assumptions.
• Defensive engineering: Naming the exact compiler flags (-Wall -Wextra -Werror), static analyzers, or runtime sanitizers (-fsanitize=address,undefined,thread) that verify correctness in CI.

Common mistakes

• Explaining only surface syntax without tracing the underlying memory addresses, ownership lifetime, or kernel/user-space state transitions.
• Assuming undefined behavior (such as signed overflow, uninitialized reads, strict-aliasing violations, or dangling pointers) will "just work" because it passed an unoptimized -O0 debug build.
• Ignoring return codes, partial reads/writes, alignment padding, or cleanup paths when an allocation or syscall fails midway through a function.