DP

Author: Skm2000

Maximum_Sum_Dividing_Recurssive.cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int main()
+ {
+	int t;
+	cin>>t;
+	while(t--){
+	    int n;
+	    cin>>n;
+	    int dp[n+1];
+	    dp[0]=0,dp[1]=1;
+	    for(int i=2;i<=n;i++){
+	        dp[i]=max(dp[i/2]+dp[i/3]+dp[i/4],i);
+	    }
+	    cout<<dp[n]<<"\n";
+	}
+	return 0;
+}

Maximum_length_of_pairs.cpp

@@ -0,0 +1,18 @@
+int findLongestChain(vector<vector<int>>& pairs) {
+        int n=pairs.size();
+        int dp[n+1],res=1;
+        sort(pairs.begin(),pairs.end());
+        for(int i=0;i<n;i++){
+            dp[i]=1;
+        }
+        for(int i=1;i<n;i++){
+            for(int j=0;j<i;j++){
+                if(pairs[i][0]>pairs[j][1]){
+                    dp[i]=max(dp[i],1+dp[j]);
+                }
+            }
+            res=max(res,dp[i]);
+        }
+        if(n==0)return 0;
+        else return res;
+    }

Minimum_Ascii_Sum_deletion_To_Make_two_Strings_equal.cpp

@@ -0,0 +1,39 @@
+#include<bits/stdc++.h>
+using namespace std;
+int minimumDeleteSum(string s1, string s2) {
+        int m=s1.length(),n=s2.length();
+        int dp[m+1][n+1];
+        for(int i=0;i<=m;i++){
+            for(int j=0;j<=n;j++){
+                dp[i][j]=0;
+            }
+        }
+        for(int i=1;i<=m;i++){
+            dp[i][0]=dp[i-1][0]+s1[i-1];
+        }
+        for(int j=1;j<=n;j++){
+            dp[0][j]=dp[0][j-1]+s2[j-1];
+        }
+        for(int i=1;i<=m;i++){
+            for(int j=1;j<=n;j++){
+                if(s1[i-1]==s2[j-1]){
+                    dp[i][j]=dp[i-1][j-1];
+                }
+                else{
+                    dp[i][j]=min(dp[i-1][j]+s1[i-1],dp[i][j-1]+s2[j-1]);
+                }
+            }
+        }
+        for(int i=0;i<=m;i++){
+            for(int j=0;j<=n;j++){
+                cout<<dp[i][j]<<" ";
+            }
+            cout<<"\n";
+        }
+        return dp[m][n];
+}
+int main(){
+    string s1="eat";
+    string s2="sea";
+    minimumDeleteSum(s1,s2);
+}

Optimal_Strategy_To_Play_A_Game.cpp

@@ -0,0 +1,24 @@
+#include<bits/stdc++.h>
+#define N 5
+using namespace std;
+
+int dp[N][N];
+
+int OptimalStrategy(int coins[],int i,int j){
+    //Base Cases
+    if(i==j)  return coins[i];
+    if(i==j+1) return max(coins[i],coins[j]);
+    if(dp[i][j]==0){
+        //Taking from the start
+        int start = coins[i] + min(OptimalStrategy(coins,i+2,j),OptimalStrategy(coins,i+1,j-1));
+        //Taking from end
+        int end = coins[j] + min(OptimalStrategy(coins,i,j-2),OptimalStrategy(coins,i+1,j-1));
+        //maximum of both
+        dp[i][j] = max(start,end);
+    }
+    return dp[i][j];
+}
+
+int main(){
+
+}