GitHub

Longest Common Subsequence recursion + memoization.cpp

return dp[n][m] = 1+helper(x,y,n-1,m-1); // we got one subsequence so adding 1 as result else if(x[n-1]!=y[m-1]) return dp[n][m] = max(helper(x,y,n-1,m),helper(x,y,n ...
GitHub

16 Longest Common Subsequence Bottom Up(DP).cpp

// initialize 1st row and of dp matrix with 0 according to the base condition of recursion // base case of recursion --> for initialization of dp - matrix ...