Solution #39 - Neha Amin - 15/07/2025 #67
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
NEHA-AMIN
changed the title
NEHA-AMIN
force-pushed
the
feature/comb-sum
branch
2 times, most recently
from
442f5cb to
f6566a7
Compare
NEHA-AMIN
changed the title
NEHA-AMIN
changed the title
JRS296
reviewed
Jul 19, 2025
NEHA-AMIN
force-pushed
the
feature/comb-sum
branch
from
f6566a7 to
b60b3d6
Compare
NEHA-AMIN
force-pushed
the
feature/comb-sum
branch
from
b60b3d6 to
d7a478f
Compare
I've made the changes. Could you please review it again? |
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.
This PR adds a solution for Leetcode Problem: Combination Sum.
The goal is to find all unique combinations of candidate numbers where the chosen numbers sum to a given target, allowing each number to be used an unlimited number of times.
A recursive backtracking approach is employed to efficiently build valid combinations and avoid duplicates, following the problem’s requirements