Printing longest common subsequence

#1


this code is not giving ouptut of lcs in reverse order…
plz correct it
i want ouput in reverse order only…

#2

@S19LPPP0202
your else part was incorrect

if(a[i-1]==b[j-1]){
        dp[i][j]=1+dp[i-1][j-1];
    }
    else{
        dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
    }
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.