arrow_back Back to Challenges

#39 Combination Sum

Medium Acceptance 0%
description

Problem Description

Given an array of distinct integers `candidates` and a target integer `target`, return a list of all unique combinations of `candidates` where the chosen numbers sum to `target`. You may return the combinations in any order. The same number may be chosen from `candidates` an unlimited number of times.

checklist Constraints

1 <= candidates.length <= 30
2 <= candidates[i] <= 40
All elements of candidates are distinct.
1 <= target <= 40

science Examples

Case #1

In: candidates = [2,3,6,7] target = 7
Out: [[2,2,3],[7]]

Case #2

In: candidates = [2,3,5] target = 8
Out: [[2,2,2,2],[2,3,3],[3,5]]

Mastery Tags

Arrays Backtracking

Hiring Companies

Adobe Amazon Meta
code

Integrated IDE

code_blocks
Coding
psychology
Aptitude