Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 159

Lesson walkthrough

Combination Sum

MediumBacktracking

Candidates are unique. You may reuse a number. Return combinations that sum to target. Sort each combination, then sort the list.

Examples

Example 1

Input: candidates = [2,3,6,7], target = 7

Output: [[2,2,3],[7]]

Constraints

1 ≤ candidates.length ≤ 30

Target ComplexityNot required

O(n^(t/m)) Time · O(t/m) Space

Companies (5)

AmazonGoogleMetaMicrosoftApple

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputcandidates = [2,3,6,7], target = 7

Expected[[2,2,3],[7]]

Output—