37. Combination Sum II
MediumBacktracking
Given a collection of candidate numbers candidates (which may contain duplicates) and a target number target, find all unique combinations in candidates where the candidate numbers sum to target. Each number in candidates may only be used once in the combination. Note: The solution set must not contain duplicate combinations.
Examples
Input: [10,1,2,7,6,1,5] 8
Output: [[1,1,6],[1,2,5],[1,7],[2,6]]
Explanation: Four unique combinations sum to 8, each using every chosen index at most once.
Constraints
- 1 <= candidates.length <= 100
- 1 <= candidates[i] <= 50
- 1 <= target <= 30
Loading...
Run checks all cases above. Submit evaluates all test cases.