Amazon

Apple

Microsoft

Uber

eBay

2020-10-04

## 39. Combination Sum

### Question:

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.

It is guaranteed that the number of unique combinations that sum up to `target` is less than `150` combinations for the given input.

#### Example 1:

``````Input: candidates = [2,3,6,7], target = 7
Output: [[2,2,3],]
Explanation:
2 and 3 are candidates, and 2 + 2 + 3 = 7. Note that 2 can be used multiple times.
7 is a candidate, and 7 = 7.
These are the only two combinations.
``````

#### Example 2:

``````Input: candidates = [2,3,5], target = 8
Output: [[2,2,2,2],[2,3,3],[3,5]]
``````

#### Example 3:

``````Input: candidates = , target = 1
Output: []
``````

#### Example 4:

``````Input: candidates = , target = 1
Output: []
``````

#### Example 5:

``````Input: candidates = , target = 2
Output: [[1,1]]
``````

Constraints:

• `1 <= candidates.length <= 30`
• `1 <= candidates[i] <= 200`
• All elements of `candidates` are distinct.
• `1 <= target <= 500`

### Solution:

Using backtracking to check all possible combinations.

``````class Solution {
public List<List<Integer>> combinationSum(int[] candidates, int target) {
List<List<Integer>> result = new ArrayList<>();
Arrays.sort(candidates);
getSumList(result, new ArrayList<Integer>(), candidates, 0, target);
return result;
}

public void getSumList(List<List<Integer>> result, List<Integer> currList, int[] candidates, int index, int target) {
if (target == 0) {