Practice Combination Sum II
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Combination Sum II on LeetCode. Use the original task for its coding environment and submissions.
Examples
# 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] ]
Constraints
1 <= candidates.length <= 100
1 <= candidates[i] <= 50
1 <= target <= 30
Related LeetCode Problems
Practice more problems similar to Combination Sum II.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.