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.