Added Combination Sum problem #1747
Closed
Conversation
This file contains 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
|
Thank you for submitting your pull request! 🙌 We'll review it as soon as possible.). If there are any specific instructions or feedback regarding your PR, we'll provide them here. Thanks again for your contribution! 😊 |
⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀
|
ajay-dhangar
added
gssoc-ext
ajay-dhangar
requested changes
Nov 3, 2024
Comment on lines
+1
to
+4
| | id | sidebar_position | title | sidebar_label | description | tags | | ||
| |------------------|------------------|------------------|---------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------| | ||
| | combination-sum | 2 | Combination Sum | Combination Sum | 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. | java, problem-solving | | ||
|
|
There was a problem hiding this comment.
Please follow our documentation format and syntax. Also, please read our contribution guidelines carefully.
| ``` | ||
|
|
||
| ## Complexity Analysis | ||
| - **Time Complexity**: O(2^t) x O(k), where `t` is the target and `k` is the average length of combinations. |
There was a problem hiding this comment.
replace O(2^t) x O(k) with $O(2^t) \times O(k)$
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
📥 Pull Request
Description
This PR implements the Combination Sum problem solution, which returns all unique combinations of distinct integers that sum to a given target. The algorithm allows each candidate to be used an unlimited number of times. This implementation includes both a brute-force approach and an optimized backtracking approach.
Fixes # (issue number)
Type of change
Checklist: