Practice Combination Sum
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order. The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different. The test cases are generated such that the number of unique combinations that sum up to target is less than 150 combinations for the given input.
Source: Combination Sum on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
candidates = [2,3,6,7], target = 7
[[2,2,3],[7]]
# Example 2
candidates = [2,3,5], target = 8
[[2,2,2,2],[2,3,3],[3,5]]
# Example 3
candidates = [2], target = 1
[]
Constraints
Related LeetCode Problems
Practice more problems similar to Combination Sum.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.