You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Combination Sum: Backtracking Target ExplorerMedium
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak
Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.
MediumArrays & Hashing•Acceptance: 71.2%
Combination Sum: Backtracking Target Explorer
Targeted in FAANG & Tech OA:AmazonGoogleMicrosoft
Real-World Engineering Context
Used in ATM currency cash disbursement algorithms, shopping cart promotional coupon optimizers, and cloud server resource bin-packing.
Given an array of distinct integers `candidates` and a target integer `target`, return a list of all unique combinations of `candidates` where the chosen numbers sum to `target`. You may return the combinations in any order.
The same number may be chosen from `candidates` an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different.
Sample Test Cases
Input: [[2,3,6,7],7]
Expected: [[2,2,3],[7]]
Input: [[2,3,5],8]
Expected: [[2,2,2,2],[2,3,3],[3,5]]
Input: [[2],1]
Expected: []
Constraints
- 1 <= candidates.length <= 30
- 2 <= candidates[i] <= 40
- All elements of candidates are distinct.
- 1 <= target <= 40
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.