A strong answer
A strong candidate frames How would you debug a counter that loses increments under threads? around the exact memory layout, compiler semantics, and hardware execution model covered in Data Races: The Bug Locks Prevent. Trace the load-add-store interleaving, separate overlap from sharing, and fix ranges plus atomics with sanitizer proof.
Your 0_Language/multithreading/a.cpp in honest form has two bugs: the partitions overlap at the boundary, and the shared sums update with no protection:
The overlap bug matters as well. Your a.cpp starts two even workers at the same boundary value. That value counts twice. The fix partitions ranges without overlap. One worker takes the lower half. The other takes the upper half with a plus-one start. Disjoint ranges plus atomic updates remove both faults at once.
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: Define a data race and explain why it is undefined behavior.
- Mastery of core invariant: Replace a racy counter with std::atomic and fetch_add.
- Mastery of core invariant: Choose between a mutex and an atomic for shared state.
- 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
-O0debug build. - Ignoring return codes, partial reads/writes, alignment padding, or cleanup paths when an allocation or syscall fails midway through a function.