Lessons from Combination Sum

Three key points:

$1.$ Allowing reuse means passing the same index (not $i + 1$) to the recursive call.

$2.$ Pruning (checking if sum exceeds target) avoids wasteful exploration.

$3.$ Backtracking works for sum-based constraints just as well as size-based constraints.