Implement a bounded concurrency runner `mapWithConcurrency(items, limit, signal, worker)` in TypeScript that maintains at most `limit` in-flight tasks without.

A strong answer

A strong candidate frames Implement a bounded concurrency runner mapWithConcurrency(items, limit, signal, worker) in TypeScript that maintains at most limit in-flight tasks without. around the exact memory layout, compiler semantics, and hardware execution model covered in [Structured Concurrency: Promise.allSettled, AbortController, and Bounded Worker Lanes]. Write the pull-based nextIndex++ coroutine lane pattern, compose AbortSignal.any([parentSignal, poolController.signal]), and explain why nextIndex++ has no race condition on a single JS thread.

During a flash sale, an order service runs await Promise.all(cartItems.map(item => fetchInventory(item))) and wraps the call in Promise.race([work, new Promise((_, rej) => setTimeout(rej, 30000))]). When a power user checks out with 2,500 items, the service opens 2,500 simultaneous TCP connections (crashing with EMFILE / connection pool timeout); when item #2 fails at 5 ms, the other 2,499 requests keep running in the background; and even on fast 4 ms checkouts, the uncleared 30-second timers leak 150,000 closures in RAM!

When engineers encounter this bottleneck in production, a surface-level API description rarely explains what went wrong. In real workloads, every line of code executes against concrete hardware constraints: fixed-width memory cells, CPU cache lines, kernel descriptor tables, network socket buffers, or accelerator memory buses. Without a clear mental model of bounded async concurrency, Promise.all vs Promise.allSettled, and AbortController propagation, debugging degrades into guesswork—tuning timeouts, adding retries, or scaling instances blindly while the underlying architectural flaw remains untouched.

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: Build pull-based bounded concurrency worker pools (K lanes sharing nextIndex++) without head-of-line batch stalls.
• Mastery of core invariant: Propagate cancellation across parent requests, timeouts, and sibling tasks using AbortController and AbortSignal.any.
• Mastery of core invariant: Eliminate dangling timer and abort-listener memory leaks using finally cleanup and AbortSignal.timeout.
• 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.