Method findLongestConseqSubseq

LongestCommonSubsequence.java:32–43

(int arr[], int N)

// Sorting solution
static int findLongestConseqSubseq(int arr[], int N)
	{
 int count=1,counter=1;
	   Arrays.sort(arr);
	   for(int i=1;i<N;i++)
	   {
	       if(arr[i]-arr[i-1]==1) count++;
	       else if(arr[i]-arr[i-1]!=0) count=1;
	       counter = Math.max(counter,count);
	   }
	   return counter;
}