Skip to main content

Longest Common Subsequence - LCS

Learn Longest Common Subsequence - LCS (Dynamic Programming, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

The Classic Two-String DP dp[i][j] = length of the LCS between the first i characters of A and first j characters of B. If the characters match, extend the diagonal; otherwise, take the best of dropping a character from either string.

More lessons in Dynamic Programming