Implement combination sum algorithm #878
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Problem: Given an array of distinct integers nums and a target integer target, return a list of all unique combinations of nums where the chosen numbers sum to target. You may return the combinations in any order. The same number may be chosen from nums an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different. The test cases are generated such that the number of unique combinations that sum up to the target is less than 150 combinations for the given input. Constraints 1≤nums.length≤30 1≤nums[i]≤40 All elements of nums are distinct. 1≤target≤40
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Problem:
Given an array of distinct integers nums and a target integer target, return a list of all unique combinations of nums where the chosen numbers sum to target. You may return the combinations in any order. The same number may be chosen from nums an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different. The test cases are generated such that the number of unique combinations that sum up to the target is less than 150 combinations for the given input.
Constraints
1≤nums.length≤30
1≤nums[i]≤40
All elements of nums are distinct.
1≤target≤40