Back
Dynamic Programming
Question 1 of 9
11% Complete
Medium
LCS recurrence: if A[i]==B[j], 1 + LCS(i-1,j-1); else max(LCS(i-1,j), _____).
Submit