partition_SUM

class Solution {
public:
    bool canPartition(vector<int>& arr) {
        int n = arr.size();
        int sum = 0;
        for(auto x: arr) {
            sum += x;
        }

        if(sum % 2) {
            return false;
        }
        sum/=2;

        int dp[n + 1][sum + 1];

        for(int j = 0; j <= sum; ++j) {
            dp[0][j] = 0;
        }

        for(int j = 0; j <= n; ++j) {
            dp[j][0] = 1;
        }

        for(int i = 1; i <= n; ++i) {
                int cur = arr[i - 1];
            for(int j = 1; j <= sum; ++j) {

                if(cur > j) {
                    dp[i][j] = dp[i - 1][j];
                }
                else {
                    dp[i][j] = dp[i - 1][j] or dp[i - 1][j - cur];
                }
            }

        }


        return dp[n][sum];
    }
};