Skip to main content
mediumNeetCode 150

Combination Sum II

Given an array of integers and a target Return all unique combinations that sum to the target Each number can be used at most ONCE Example: candidates = [10,1,2,7,6,1,5], target = 8 => [[1,1,6],[1,2,5],[1,7],[2,6]]

Combination Sum II rewards structured search and good pruning more than raw cleverness. Interviewers love it because it reveals your structured exploration and your edge-case discipline. Backtracking gets messy when you don't undo state cleanly; be disciplined about it.

Arrays & HashingBacktracking

Meet Coco

Coco is an AI study partner, not a person. She listens while you explain your code, asks what a line does and never hands you the fix. Typing with Coco is free when you sign in, up to a daily limit. Talking with her out loud comes with the $79 pack. Anyone can open the editor and run their code.

1Find All Unique Combinations (Each Element Used Once)medium
Based onLeetCode