Medium
Quiz
#40 Combination Sum II
APPROACH
Given collection candidates (which may contain duplicates) and integer target, find every unique combination of elements that sums to target. Each element may be used at most once. No duplicate combinations are allowed.
Example 1:
Input: candidates = [10,1,2,7,6,1,5], target = 8
Output:
[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]
Example 2:
Input: candidates = [2,5,2,1,2], target = 5
Output:
[
[1,2,2],
[5]
]
1 of 4
1:00
What is the optimal approach for this problem?