# Combination Sum II: Study Guide

Combination Sum II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort candidates; at each index choose or skip, and when skipping a value jump over the whole equal run so each combination is formed once. Each number may be used at most once.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(2^n).

## Common mistake

Reusing the unbounded Combination Sum I recursion, which can pick the same index twice.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at interview copilot app.