30-days-of-Dynamic-Programming/DAY-06/Minimum_sum_partition(GEEKSFORGEEKS).cpp at main · kothariji/30-days-of-Dynamic-Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>
using namespace std;

class Solution{

	public:
	int minDiffernce(int arr[], int n)
	{

	    int sum = accumulate(arr, arr+n, 0);

	    bool dp[n+1][sum+1];
	    for(int i = 0; i <n+1; i++)
	        dp[i][0] = true;
	    for(int i = 0; i <sum+1; i++)
	        dp[0][i] = false;
	    for(int i = 1; i<n+1; i++)
	        for(int j=1; j<sum+1; j++)
	        {
	            if(arr[i-1] <= j)
	               dp[i][j] = dp[i-1][j-arr[i-1]] || dp[i-1][j];
	           else
	               dp[i][j] = dp[i-1][j];
	        }
	   int minans = INT_MAX;
	   for(int i = 0; i < sum+1; i++)
	    if(dp[n][i] == true)
        {
            minans = min(minans, abs(i - (sum-i)));
        }
	   return minans;
	}
};

int main()
{


   	int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;

        int a[n];
        for(int i = 0; i < n; i++)
        	cin >> a[i];


	    Solution ob;
	    cout << ob.minDiffernce(a, n) << "\n";

    }
    return 0;