problem39

README

< Previous 　　　　　　　　　　　　　　　　 Next >

39. Combination Sum (Medium)

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeated number may be chosen from candidates unlimited number of times.

Note:

• All numbers (including target) will be positive integers.
• The solution set must not contain duplicate combinations.

Example 1:

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
  [7],
  [2,2,3]
]

Example 2:

Input: candidates = [2,3,5], target = 8,
A solution set is:
[
  [2,2,2,2],
  [2,3,3],
  [3,5]
]

Related Topics

[Array] [Backtracking]

Similar Questions

1. Letter Combinations of a Phone Number (Medium)
2. Combination Sum II (Medium)
3. Combinations (Medium)
4. Combination Sum III (Medium)
5. Factor Combinations (Medium)
6. Combination Sum IV (Medium)