Combination Sum
Combination Sum is a algorithm in the sets & dynamic programming family. This problem is naturally expressed as smaller overlapping states/subproblems or as controlled generation of combinations.
Start with this mental model
Combination Sum is a algorithm in the sets & dynamic programming family. This problem is naturally expressed as smaller overlapping states/subproblems or as controlled generation of combinations.
How it works, without unnecessary jargon
Combination Sum should be understood through its invariant and the state it changes at each step.
The practical complexity in this reading is Varies by implementation / input constraints; always connect that cost to the actual loops, recursion, data structure operations or input assumptions.
Read the algorithm as a sequence of decisions
Define the state precisely.
Write the transition/choice from smaller states.
Set base cases, then decide memoization, tabulation or backtracking.
Read a tiny input by hand and write down the state after every important operation. For Combination Sum, the goal is to make the invariant visible rather than to memorize code.
Varies by implementation / input constraints
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
Good fit
- Use DP when subproblems overlap and optimal solutions can be composed from smaller optimal states.
What usually goes wrong
- Writing recurrence before defining state.
- Using DP when state space is larger than the original problem.
A professional answer shape
A strong interview explanation of Combination Sum should cover the problem it solves, its invariant, the important data structure/state, its Varies by implementation / input constraints cost, and the constraint that would make you choose a different approach.
What problem does Combination Sum solve?
Combination Sum is a algorithm in the sets & dynamic programming family. This problem is naturally expressed as smaller overlapping states/subproblems or as controlled generation of combinations.
What should I mention about complexity?
Its typical cost here is Varies by implementation / input constraints, but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
What is the most common mistake?
Writing recurrence before defining state.