Combination Sum III Problem

Combination Sum III Problem — ExecCode Medium DSA Practice

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

Problem description

Combination Sum III. 1..9 pick k summing to n. For Combination Sum III, focus on the exact input variables, return only the requested value, and preserve the required time complexity for the intended pattern.

Examples

Input {"k": 3, "n": 7}; Output [[1, 2, 4]]

Constraints

1 ≤ n ≤ 10^5

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