Combination sum
Given a list of distinct positive integers and a target, return all unique combinations where the chosen numbers sum to target. The same number may be used unlimited times. Each combination must be sorted ascending and the overall list sorted. 1 <= len(candidates) <= 8, target <= 30.
Implement
combination_sum(candidates: list[int], target: int) → list[list[int]]Examples
in
[[2,3,6,7],7]out[[2,2,3],[7]]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 22 min
solution.py
InputExpectedGot
[[2,3,6,7],7][[2,2,3],[7]]not run yetsample