Skip to content

problem4.md

Latest commit

 

History

History
17 lines (13 loc) · 597 Bytes

problem4.md

File metadata and controls

17 lines (13 loc) · 597 Bytes

Problem 4: The Combination Lock (Combination Sum)

Problem Statement

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. The same number may be chosen from candidates an unlimited number of times.

Input Format

  • An array of distinct integers candidates.
  • An integer target.

Constraints

  • 1 <= candidates.length <= 30
  • 2 <= candidates[i] <= 40
  • 1 <= target <= 40

Example

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