Combination Sum II
Subsequences Pattern DSA practice problem on Onlearn.
Difficulty: medium.
Topics: Combination Sum II - Find all unique combinations that sum to a target, with each element used only once and no duplicate combinations, Recursion, Backtracking, Sorting, Combinatorics, Time Complexity, Space Complexity, Arrays, sorting algorithms, backtracking, search space optimization, duplicate handling, recursion, time complexity analysis, Backtracking Constraints, Backtracking.
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. Note: The solution set must not contain duplicate combinations. Examples: Example 1: Input: candidates = [10,1,2,7,6,1,5], target = 8 Output: Explanation: These are the unique combinations whose sum is equal to target. Example 2: Input: candidates = [2,5,2,1,2], target = 5 Output: [[1,2,2],[5]] Explanation: These are the unique combinations whose sum is equal to target.