Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upMinimum sum partition #1338
Merged
Minimum sum partition #1338
+78
−0
Conversation
Given an array, the task is to divide it into two sets S1 and S2 such that the absolute difference between their sums is minimum.
@@ -0,0 +1,64 @@ | |||
// Partition a set into two subsets such that the difference of subset sums is minimum | |||
|
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
Added some test cases for better understanding.
@swatiprajapati08 good work |
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.
swatiprajapati08 commentedJun 1, 2020
Given an array, the task is to divide it into two sets S1 and S2 such that the absolute difference between their sums is minimum.