Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 160

Combination Sum II

MediumBacktracking

candidates may contain duplicates. Each index may be used once. Return unique combinations summing to target. Sort each combination, then sort the list.

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]]

Constraints

1 ≤ candidates.length ≤ 100

Target ComplexityNot required

exponential Time · O(depth) Space

Companies (3)

AmazonMicrosoftGoogle

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputcandidates = [10,1,2,7,6,1,5], target = 8

Expected[[1,1,6],[1,2,5],[1,7],[2,6]]

Output—