Solution #40 - Neha Amin - 14/07/2025 #66
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
NEHA-AMIN
changed the title
NEHA-AMIN
force-pushed
the
feature/com-sum-2
branch
from
07aef32 to
7941787
Compare
NEHA-AMIN
changed the title
NEHA-AMIN
changed the title
NEHA-AMIN
force-pushed
the
feature/com-sum-2
branch
from
7941787 to
8116169
Compare
NEHA-AMIN
changed the title
NEHA-AMIN
changed the title
NEHA-AMIN
changed the title
JRS296
reviewed
Jul 19, 2025
|
Kindly check if this has already been solved as well, we cannot have a repition |
NEHA-AMIN
force-pushed
the
feature/com-sum-2
branch
from
8116169 to
88547b3
Compare
NEHA-AMIN
force-pushed
the
feature/com-sum-2
branch
from
88547b3 to
778d141
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 II.
The goal is to find all unique combinations in a list of numbers where the chosen numbers sum to a given target, with each number used at most once per combination.
A backtracking approach is used to efficiently explore combinations while avoiding duplicates by sorting and skipping repeated elements