The Wayback Machine - https://web.archive.org/web/20200608225457/https://github.com/TheAlgorithms/Java/pull/1338
Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Minimum sum partition #1338

Merged
merged 2 commits into from Jun 3, 2020
Merged

Minimum sum partition #1338

merged 2 commits into from Jun 3, 2020

Conversation

@swatiprajapati08
Copy link
Contributor

swatiprajapati08 commented Jun 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.

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.

Copy link
@deadshotsb

deadshotsb Jun 2, 2020

Member

Kindly provide some sample test cases

This comment has been minimized.

Copy link
@swatiprajapati08

swatiprajapati08 Jun 3, 2020

Author Contributor

Added.

Added some test cases for better understanding.
Copy link
Member

deadshotsb left a comment

@swatiprajapati08 good work

@deadshotsb deadshotsb merged commit 4ac4a62 into TheAlgorithms:master Jun 3, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Linked issues

Successfully merging this pull request may close these issues.

None yet

2 participants
You can’t perform that action at this time.