Dsa
Backtracking
Medium
Combination Sum with Duplicates
Given a list of integers and a target sum, return all unique combinations of numbers from the list that can sum up to the target. Note that the same number can be used multiple times in the sum but should not be included more than once in the result. Each combination should be printed as a space-separated string.
Example Input:
4
2 3 6 7
7
Example Output:
2 2 3
7
Key concepts
backtrackingcombinationssum
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now