Combination Sum
Detailed guide and Python implementation for the 'Combination Sum' problem.
Problem Statement
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.
Implement a function combinationSum(candidates: list, target: int) -> list.
- •1 <= candidates.length <= 30
- •2 <= candidates[i] <= 40
- •All elements of candidates are distinct
- •1 <= target <= 40
Examples
[2,3,6,7], 7
[[2,2,3],[7]]
2 + 2 + 3 = 7 and 7 = 7. These are the only two combinations.
[2,3,5], 8
[[2,2,2,2],[2,3,3],[3,5]]
2+2+2+2 = 8, 2+3+3 = 8, and 3+5 = 8.
[2], 1
[]
No combination of 2's can sum to 1.
Need a Hint?
Edge Cases to Watch
- Empty input structures
- Single element inputs
- Large numerical bounds
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.
Recommended Python Resources
Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.
Python Loops
Learn how to use Python loops to iterate over data. Master for loops, while loops, break, continue, and loop best practices with interactive examples.
How to Sort a List in Python
Learn how to sort a list in Python using the sort() method and the sorted() function. Discover custom key sorting and reverse order examples.
Python String Methods
A complete reference guide for Python string manipulation. Master formatting, searching, splitting, replacing, and checking string properties.
Python vs JavaScript: Which Programming Language is Best?
A comprehensive comparison between Python and JavaScript. Explore syntax differences, performance, use cases (backend vs frontend), and coding examples.