Combination Sum II
Given a collection of candidate numbers (candidates) 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.

30:00

Combination Sum II
medium
Topics
Companies

Given a collection of candidate numbers (candidates) 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.

Example 1:
Input: {"candidates":[10,1,2,7,6,1,5],"target":8}
Output: [[1,1,6],[1,2,5],[1,7],[2,6]]
Constraints:

  • 1≤candidates.length≤1001 \leq \text{candidates.length} \leq 100

  • 1≤candidates[i]≤501 \leq \text{candidates}[i] \leq 50

  • 1≤target≤301 \leq \text{target} \leq 30

Input
arr ={"candidates":[10,1,2,7,6,1,5],"target":8}

Check sum: 0 vs target 8

Candidates

1

1

2

5

6

7

10

Current Combination

Empty

Sum: 0
Found Solutions
Variables
No variables to display
DepthFunction Call
Stack empty
0/278