Added Longest Palliandromic subsequence

Algorithms/LongestPallindromicSubsequenc.java

@@ -0,0 +1,55 @@
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+class LongestPallindromicSubsequenc{
+
+    int max(int a, int b)
+    {
+        return (a>b ? a:b);
+    }
+
+    int LCS(int n, char[] arr, char[] b){
+
+        int[][] dp=new int[n+1][n+1];
+
+        for(int i=0;i<n;i=i+1){
+            for(int j=0;j<n;j=j+1){
+                dp[i][0]=0;
+                dp[0][j]=0;
+            }
+        }
+
+        for(int i=1;i<=n;i=i+1){
+            for(int j=1;j<=n;j=j+1){
+                if(arr[i-1]==b[j-1]){
+                    dp[i][j]=dp[i-1][j-1]+1;
+                }
+                else{
+                    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
+                }
+            }
+        }
+
+        return dp[n][n];
+    }
+
+    public static void main(String args[]){
+        Scanner sc=new Scanner(System.in);
+        int testcases=sc.nextInt();
+        while(testcases-->0){
+            String str=sc.next();
+            int n=str.length();
+            char[] arr=str.toCharArray();
+            char[] b=new char[n];
+
+            for(int i=0;i<n;i=i+1){
+                b[i]=arr[n-i-1];
+            }
+
+            LongestPallindromicSubsequenc LPS=new LongestPallindromicSubsequenc();
+            int result=LPS.LCS(n, arr, b);
+            System.out.println(result);
+        }
+    }
+}

recursiveBinarysearch.java → Algorithms/recursiveBinarysearch.java

@@ -1,29 +1,29 @@
-package Searching;
-import Sorting.Selection;
-import java.util.Scanner;
-
-public class recursiveBinarysearch {
-static Scanner sc=new Scanner(System.in);
-	    public static int search(int array[],int key,int li,int ui) {
-		int curindex=(li+ui)/2;
-		if(li>ui)return -1;
-		if(array[curindex]==key)return key;
-		else if(key>array[curindex])return search(array,key,curindex+1,ui);
-		else 
-			return search(array,key,li,curindex-1); 
-	}
-	public static void main(String[] args) {
-		// TODO Auto-generated method stub
-		int n=sc.nextInt();
-		int array[]=new int[n];
-		for(int i=0;i<n;i++)
-			array[i]=sc.nextInt();
-		Selection.sort(array);
-		int key=sc.nextInt();
-		int x=search(array,key,0,n-1);
-		if(x==key)System.out.println("Yes");
-		if(x==-1)
-			System.out.println("no");
-		}
-
-}
+package Searching;
+import Sorting.Selection;
+import java.util.Scanner;
+
+public class recursiveBinarysearch {
+static Scanner sc=new Scanner(System.in);
+	    public static int search(int array[],int key,int li,int ui) {
+		int curindex=(li+ui)/2;
+		if(li>ui)return -1;
+		if(array[curindex]==key)return key;
+		else if(key>array[curindex])return search(array,key,curindex+1,ui);
+		else 
+			return search(array,key,li,curindex-1); 
+	}
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		int n=sc.nextInt();
+		int array[]=new int[n];
+		for(int i=0;i<n;i++)
+			array[i]=sc.nextInt();
+		Selection.sort(array);
+		int key=sc.nextInt();
+		int x=search(array,key,0,n-1);
+		if(x==key)System.out.println("Yes");
+		if(x==-1)
+			System.out.println("no");
+		}
+
+}