0/1 knapsack vs unbounded knapsack: what changes in the code?

A strong answer

A strong candidate frames 0/1 knapsack vs unbounded knapsack: what changes in the code? around the exact memory layout, compiler semantics, and hardware execution model covered in Knapsack and subsets. Write both with a one-dimensional table, explain why the loop direction is the whole difference, and discuss complexity.

The 0/1 knapsack problem: items each have a weight and a value; choose a subset whose total weight fits within a capacity W and whose total value is as large as possible. Each item is either taken or not, hence 0/1. It models any decision of the form "pick some of these, within a budget": projects within a budget, ads within a time slot, files within a disk.

Trying every subset is 2ⁿ: about a trillion selections for 40 items. Greedy rules, such as taking the best value per kilogram first, fail: with capacity 4 and items (3 kg, value 5) and two of (2 kg, value 3), value per kilogram picks the first item and then nothing fits, for 5, while the two 2 kg items give 6.

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: Solve 0/1 knapsack with a table over capacity, and explain the take-or-skip recurrence.
• Mastery of core invariant: Distinguish 0/1 and unbounded variants by the direction of the capacity loop.
• Mastery of core invariant: Recognize subset sum, partition, coin change and counting variants, and explain pseudo-polynomial time.
• 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.