Minimum sum partition problem in JAVA, C++, Python and C

[dhruvmillu]

Minimum sum partition problem

Given a set of integers, the task is to divide it into two sets S1 and S2 such that the absolute difference between their sums is minimum. If there is a set S with n elements, then if we assume Subset1 has m elements, Subset2 must have n-m elements and the value of abs(sum(Subset1) – sum(Subset2)) should be minimum.

Example

Input:  arr[] = {1, 6, 11, 5} 
Output: 1
Explanation:
Subset1 = {1, 5, 6}, sum of Subset1 = 12 
Subset2 = {11}, sum of Subset2 = 11    

Solution

Will provide the solution for Minimum sum partition problem in Java, Python, C and C++ will proper comments and documentation.

I would like to work on this issue. Could you please assign this issue to me under SSoC ' 23.

[Kumar-laxmi]

Assigned! @dhruvmillu : C, C++, Python and Java

[Tanyamodi]

I would like to work on this issue, kindly assign this to me.

[github-actions[bot]]

This issue has been automatically closed because it has been inactive for many days. Please reopen if you still intend on working on this problem