Combination Sum III K Numbers Problem

Combination Sum III K Numbers Problem — ExecCode Medium DSA Practice

Solve the Combination Sum III K Numbers 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

Description A sequence of values is given, and order matters. In Combination Sum III K Numbers, the goal is to transform, count, or select values according to the exact rule. k, n (two integers). Return JSON array of integer arrays.

Examples

Input {"k": 3, "n": 7}; Output [[1, 2, 4]]. Input {"k": 3, "n": 9}; Output [[1, 2, 6], [1, 3, 5], [2, 3, 4]]. Input {"k": 2, "n": 18}; Output []

Constraints

2 <= k <= 9

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