Create Longest Palindromic Subsequence.java

Author: Utkarssh11

Longest Palindromic Subsequence.java

@@ -0,0 +1,36 @@
+GFG
+Longest Palindromic Subsequence
+
+
+
+
+class Solution
+{
+    public int longestPalinSubseq(String S)
+    {
+        //code here
+        StringBuilder str = new StringBuilder(S);
+        String s1 = S;
+        String s2 = str.reverse().toString();
+        int n = S.length();
+        int dp[][] = new int[n+1][n+1];
+
+
+        for( int i =0 ; i<=n ;i++)
+        {
+            for( int j =0; j<=n;j++)
+            {
+                if(i==0 || j==0)
+                dp[i][j] =0; 
+
+               else if( s1.charAt(i-1)==s2.charAt(j-1) )
+                    dp[i][j] = 1+dp[i-1][j-1];  
+
+                else
+                    dp[i][j] = Math.max(dp[i-1][j] , dp[i][j-1]);
+            }
+        }
+
+        return dp[n][n];
+    }
+}