for(int i=1;i < nums.length;i++){// start from i=1 as we know at index 0 the longest length is 1 local = Math.max(dp[j],local);// among the all the numbers smaller than curret number check which has ...

LCS Problem Statement: Given two sequences, find the length of longest subsequence present in both of them. A subsequence is a sequence that appears in the same relative order, but not necessarily ...