Dynamic Programming : Minimum Sum Partition

[AnimeshMore]

Given an integer array arr 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

[AnimeshMore]

@avinash201199 Pls assign me this issue to me for contributing to this question in C++

[avinash201199]

@AnimeshMore Go ahead :)