Leetcode 39. Combination Sum

Given distinct candidate integers and a target, return all unique order-insensitive combinations where each candidate may be used unlimited times and the numbers sum to the target. This is a classic backtracking/DFS with pruning problem to generate combinations without duplicates.