Don't know how to start this question

#1

how could i approach this question

#2

DP states will be like -:
----------------| max( dp[n-1][m][k] , dp[n][m-1][k] , dp[n-1][m-1][k] +1) ; if(a[i] == b[j])
dp[i][j][k] = |------------------------------------------------------------------------------------------------
----------------| max( dp[n-1][m][k] , dp[n][m-1][k] , dp[n-1][m-1][k-1] +1) ; if(a[i] ! = b[j] )

#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.