Combination Sum II

The problem 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. The solution set must not contain duplicate combinations. Examples Input: candidates = [10,1,2,7,6,1,5], target = 8 Output: [ [1,1,6], [1,2,5], [1,7], [2,6] ] Input: candidates = [2,5,2,1,2], target = 5 Output: [ [1,2,2], [5] ] Constraints 1 <= candidates.length <= 100 1 <= candidates[i] <= 50 1 <= target <= 30 Explanation From the description of the problem, we learn that we are given an array of numbers candidates and we want to find every combination that will sum to the given target. ...