Problem: Combination Sum
Explore how to use recursion with backtracking to find all unique combinations of numbers in an array that sum to a given target. Understand pruning techniques and how to implement an efficient solution in Go that avoids duplicates by recursion on sorted candidates and tracks combinations incrementally.
We'll cover the following...
Statement
Given an array of distinct integers candidates and a target integer target, return all unique combinations of numbers from candidates that sum up to target. The combinations may be returned in any order.
Each number in candidates may be selected an unlimited number of times. Two combinations are considered unique if they differ in the frequency of at least one chosen number.
Constraints:
candidates.lengthcandidates[i]All elements of
candidatesare distinct.target...