Minimum Sum Partition (CPP)

[pranil-19]

Given an integer array A of size N, the task is to divide it into two sets S1 and S2 such that the absolute difference between their sums is minimum and find the minimum difference

EXAMPLE: Input: N = 4, A[ ] = {1, 6, 11, 5} Output: 1 Explanation: Subset1 = {1, 5, 6}, sum of Subset1 = 12 Subset2 = {11}, sum of Subset2 = 11

// I wanna contribute this to DP folder , Please assign this to me

[leninmeher]

Can you assign this to me..??

[i-s0nic]

@arnab2001 please assign this to me