Solution: Combination Sum
Explore a dynamic programming method to solve the combination sum problem, where you find all unique combinations of distinct integers adding to a target. Understand the recursive approach, recognize optimal substructure and overlapping subproblems, and implement an efficient table-based solution to reduce redundant computation. Learn to evaluate time and space complexity while coding this algorithm in C++.
Statement
Given an array of distinct integers, nums, and an integer, target, return a list of all unique combinations of nums where the chosen numbers sum up to the target. The combinations may be returned in any order.
An integer from nums may be chosen an unlimited number of times. Two combinations are unique if the
frequency of at least one of the chosen integers is different.
Constraints:
-
nums.length -
nums[i] -
target