Leetcode 216. Combination Sum III
Find all unique k-sized subsets of distinct numbers from 1–9 that sum to n. The core challenge is a combinatorial search (backtracking/DFS) with pruning since each number can be used at most once and combinations are unordered.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.