🧠 Before you code — what pattern fits?
Find all valid combinations of k numbers that sum to n, using only numbers 1 through 9, each at most once. Return the list of all such combinations (no duplicates).
(k=3, n=7) → [[1,2,4]]
(k=3, n=9) → [[1,2,6],[1,3,5],[2,3,4]]
🎬 Video explanation · Knowledge Center
Your solution runs against 3 unit tests, including edge and large-value cases.
Loading...
Test console · 3 unit tests
Submit your code to run it against all 3 unit tests. Results appear here.
JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.