Unique Combinations Sum | Dataford Interview Questions

Given a set of integers, find all unique combinations that sum up to a target value.

Implement find_combinations(nums, target), using each input element at most once. The input contains nonnegative integers, and duplicate values must not produce duplicate combinations.

Return a list of combinations, with each combination sorted in nondecreasing order and the result generated in lexicographic order. Return [[]] when target is zero and no elements are selected.

Constraints

1 <= nums.length <= 30
0 <= nums[i] <= 100
0 <= target <= 1000
Each input element may be used at most once
The output must not contain duplicate combinations

Function Signature

def find_combinations(nums, target):

Your question is Unique Combinations Sum. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem