Minimum Sum Partition
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.
Input:
The first line contains an integer ‘T’ denoting the total number of test cases. In each test cases, the first line contains an integer ‘N’ denoting the size of array. The second line contains N spaceseparated integers A1, A2, …, AN denoting the elements of the array.Output:
In each seperate line print minimum absolute difference.Constraints:
1<=T<=30
1<=N<=50
1<=A[I]<=50
Example:
 Input:
2
4
1 6 5 11
4
36 7 46 40 Output :
1
23 Explaination :
Subset1 = {1, 5, 6}, sum of Subset1 = 12
Subset2 = {11}, sum of Subset2 = 11
Solution
The DP equation should be:
 f(i, sum)=abs(f(i1, sum)sum) \< abs(f(i1, sumai)+aisum)? f(i1,sum):f(i1,sumai)+ai
Note f(i, sum) means till arr[i] number, the closest sum to the
sum
in f(i, sum).


Always welcome new ideas and practical
tricks, just leave them in the comments!