Combination Sum Problem

Combination Sum Problem — ExecCode Medium DSA Practice

Solve the Combination Sum problem on ExecCode. Free online medium DSA practice in Backtracking. Write and run code in Java, C++, Python — no signup required to run.

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. The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different.

Examples

Input candidates = [2, 3, 6, 7], target = 7; Output [[2, 2, 3], [7]]. Input candidates = [2, 3, 5], target = 8; Output [[2, 2, 2, 2], [2, 3, 3], [3, 5]]. Input candidates = [2], target = 1; Output []

Constraints

1 <= candidates.length <= 30 1 <= target <= 40 All candidates are distinct.

Practice Combination Sum free on ExecCode. Browse DSA problems, topic map, and placement guides.