Solvarch
DSA ProblemsProgressPlanRoadmapsReviewCheat SheetsCompaniesSystem DesignCS FundamentalsQuestion Bank
Theme
Problems

Combination Sum II

Medium
backtrackingrecursionarray

Given a list of positive integers candidates (duplicates possible) and a target, return all unique combinations summing to target. Each candidate may be used at most once.

Input

  • Line 1: space-separated candidates
  • Line 2: integer target

Output: one combination per line, elements in non-decreasing order; no duplicate lines.

Example 1
Input:
10 1 2 7 6 1 5
8
Output:
1 1 6
1 2 5
1 7
2 6
Example 2
Input:
2 5 2 1 2
5
Output:
1 2 2
5

Constraints

  • 1 ≤ candidates.length ≤ 100
  • 1 ≤ candidates[i] ≤ 50
  • 1 ≤ target ≤ 30
Watch a video walkthrough

Run your code against the sample tests, or Submit to run the full suite.