Combination Sum — Medium Coding Interview Question

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.

Example

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

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

Constraints

• 1 <= candidates.length <= 30

Topics & Companies

Topics: backtracking, arrays

Asked by: Airbnb, Amazon

Optimal Solution Complexity

Time complexity: O(2^target). Space complexity: O(target).

Practice more

• All DSA Problems
• DSA Patterns