Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Minimum sum partition#1338

Merged
deadshotsb merged 2 commits intoTheAlgorithms:masterfrom
swatiprajapati08:patch-1
Jun 3, 2020
Merged

Minimum sum partition#1338
deadshotsb merged 2 commits intoTheAlgorithms:masterfrom
swatiprajapati08:patch-1

Conversation

@swatiprajapati08
Copy link
Contributor

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

Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Kindly provide some sample test cases

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Added.

Added some test cases for better understanding.
Copy link
Member

@deadshotsb deadshotsb left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@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

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants