Interview Bootcamp
Vote

0% completed

​

Combination Sum (medium)

Problem Statement

Given an array of distinct positive 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.

Example 1:

Input: candidates = [2, 3, 6, 7], target = 7  
Output: [[2, 2, 3], [7]]  
Explanation: The elements in these two combinations sum up to 7.
`

.....

.....

.....

Like the course? Get enrolled and start learning!
M

makarand.h

· 2 years ago

It is not accepting correct results.

[[7], [2, 2, 3]] and [[2, 2, 3], [7]] both should be accepted but it doesn't.

S

Shane

· 3 years ago

[https://pythontutor.com/visualize.html#mode=display

Mohammed Dh Abbas

Mohammed Dh Abbas

· 2 years ago

class Solution:
  def combinationSum(self, candidates, target):
  
    def backtrack(result, index, path, add):
      if add > target:
        return 
        
      if add == target:
        result.append(path[:])
         
      for i in range(index, len(candidates)):

        path.append(candidates[i])
        add += candidates[i]
        backtrack(result, i, path, add)
        add -= candidates[i]
        path.pop()

    result = []
    backtrack(result, 0, [], 0)
     
    return result
F

focusssspro

· 3 months ago

You have test case:


[2,3,5]
0

But in constrains it is said: 1 <= target <= 40