Solution: Combination Sum
Explore how to solve the Combination Sum problem with dynamic programming by creating a dp table that stores unique number combinations for each target value. Understand optimal substructure and overlapping subproblems properties and learn to optimize recursive solutions to achieve better time and space complexity.
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