Added Solutions

programming/dynamic-programming/adhoc/Longest_Pallindromic _Subsequence.java

@@ -0,0 +1,28 @@
+public class Solution {
+    public int solve(String A) {
+        int l=A.length();
+        int L[][]=new int[A.length()][A.length()];
+       for(int i=0;i<l;i++){
+           L[i][i]=1;
+       }
+       int j;
+       for(int k=2;k<=l;k++){
+           for(int i=0;i<l-k+1;i++){
+             j=i+k-1;
+             if(A.charAt(i)==A.charAt(j)&&k==2){
+                 L[i][j]=2;
+             }
+             else if(A.charAt(i)==A.charAt(j)){
+                 L[i][j]=L[i+1][j-1]+2;
+             }
+             else
+             L[i][j]=Math.max(L[i][j-1],L[i+1][j])
+               ;
+           }
+
+       }
+       return L[0][l-1];
+
+
+    }
+}

programming/dynamic-programming/adhoc/Maximum Sum

@@ -0,0 +1,23 @@
+public class Solution {
+    public int solve(int[] a, int B, int C, int D) {
+       int n=a.length;
+       if(n==1)return a[0]; 
+        int l[]=new int[n];
+           int r[]=new int[n];
+           l[0]=a[0]*B;
+           for(int i=1;i<n;i++){
+               if(a[i]*B>=l[i-1])l[i]=a[i]*B;
+               else l[i]=l[i-1];
+           }
+           r[n-1]=D*a[n-1];
+           for(int j=n-2;j>=0;j--){
+                if(a[j]*D>=r[j+1])r[j]=a[j]*D;
+                else r[j]=r[j+1];
+           }
+           int max=0;
+           for(int i=0;i<n;i++){
+               max=Math.max(l[i]+(a[i]*C)+r[i],max);
+           }
+           return max;
+    }
+}

programming/dynamic-programming/adhoc/Min Sum Path in Matrix.java

@@ -0,0 +1,21 @@
+public class Solution {
+    public int minPathSum(int[][] A) {
+
+        int n=A.length;
+        int m=A[0].length;
+         int a[][]=new int[n][m];
+         a[0][0]=A[0][0];
+        for(int i=1;i<m;i++){
+            A[0][i]+=A[0][i-1];
+        }
+         for(int i=1;i<n;i++){
+            A[i][0]+=A[i-1][0];
+        }
+        for(int i=1;i<n;i++){
+            for(int j=1;j<m;j++){
+                A[i][j]=Math.min(A[i][j]+A[i-1][j],A[i][j]+A[i][j-1]);
+            }
+        }
+        return A[n-1][m-1];
+    }
+}

programming/dynamic-programming/adhoc/Unique Paths in a Grid.java

@@ -0,0 +1,25 @@
+public class Solution {
+    public int uniquePathsWithObstacles(int[][] a) {
+        int n=a.length;
+        int m=a[0].length;
+        int min[][]=new int[n][m];
+        if(a[0][0]==0)min[0][0]=1;
+        for(int i=1;i<n;i++){
+            if(a[i][0]==0)
+            min[i][0]=min[i-1][0];
+        }
+        for(int i=1;i<m;i++){
+            if(a[0][i]==0)
+            min[0][i]=min[0][i-1];
+        }
+        for(int i=1;i<n;i++){
+            for(int j=1;j<m;j++){
+                if(a[i][j]==0){
+                    min[i][j]=min[i-1][j]+min[i][j-1];
+                }
+        }
+        }
+        return min[n-1][m-1];
+
+    }
+}