Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
The same repeated number may be chosen from C unlimited number of times.
For example, given candidate set
[2, 3, 6, 7] and target
A solution set is:
[ , [2, 2, 3] ]
Subscribe to see which companies asked this question.