From 80fbbadf43497375263f72ee0115e5fa7a72ca7d Mon Sep 17 00:00:00 2001
From: Debayan97531 <debayankumar09@gmail.com>
Date: Thu, 13 Oct 2022 17:44:13 +0530
Subject: [PATCH] Added

---
 .../Dynamic Programming/partiton.cpp          | 48 +++++++++++++++++++
 1 file changed, 48 insertions(+)
 create mode 100644 Dynamic Programming/Dynamic Programming/partiton.cpp

diff --git a/Dynamic Programming/Dynamic Programming/partiton.cpp b/Dynamic Programming/Dynamic Programming/partiton.cpp
new file mode 100644
index 0000000..13c187e
--- /dev/null
+++ b/Dynamic Programming/Dynamic Programming/partiton.cpp	
@@ -0,0 +1,48 @@
+//Partition Problem
+
+
+class Solution{
+public:
+    bool isSubsetSum(int arr[], int sum,int n){
+        // code here 
+        //int n=arr.size();
+        vector<vector<bool>> dp(n+1,vector<bool>(sum+1));
+        for(int i=0;i<n+1;i++)
+        {
+           for(int j=0;j<sum+1;j++)
+           {
+               if(i==0) dp[i][j]=false;
+               if(j==0) dp[i][j]=true;
+           }
+        }
+        //for(int j=0;j<sum+1;)
+        for(int i=1;i<=n;i++)
+        {
+            for(int j=1;j<=sum;j++)
+            {
+                if(arr[i-1]<=j)
+                {
+                    //dp[i][j]=(dp[i-1][j-arr[i-1]]||dp[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];
+                }
+            }
+        }
+        return dp[n][sum];
+    }
+    int equalPartition(int N, int arr[])
+    {
+        // code here
+        if(N==0) return 1;
+        else
+        {
+            int sum=0;
+            for(int i=0;i<N;i++) sum+=arr[i];
+            if(sum%2!=0) return false;
+            else if(sum%2==0) return isSubsetSum(arr,sum/2,N);
+        }
+    }
+};
\ No newline at end of file