Array
216. Combination Sum III
Find every combination of exactly k distinct digits from 1–9 that sums to n. It's backtracking — build combinations digit by digit — but the tiny fixed universe (just 1 through 9) makes it a showcase…
Loading…
Find every combination of exactly k distinct digits from 1–9 that sums to n. It's backtracking — build combinations digit by digit — but the tiny fixed universe (just 1 through 9) makes it a showcase…
Loading…