Recursion & BacktrackingCombination Sum

solution.py

⌘↵ run

Combination Sum

medium

You've got this! Start small, think out loud.

Given an array of distinct integers `candidates` and a target integer `target`, return all unique combinations of candidates where the chosen numbers sum to target. The same number may be used multiple times.

Time:O(n^(t/m))

Space:O(t/m)

backtrackingrecursiongoogle-favorite

Need a refresher? Back to Learn

OUTPUT

Run your code to see output