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.
Asked at:
Expedia
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early June, 2026
Expedia
Mid-level
Hello Interview Premium
Your account is free and you can post anonymously if you choose.