CoursesDynamic ProgrammingSequence & String DP
Longest Common Subsequence
THE prefix table: dp[i][j] = LCS of the first i chars of a and first j of b — match takes the diagonal + 1, mismatch takes the better neighbor, and dp row i pairs with a.charAt(i-1), not a.charAt(i).
AlgoFox Pro
Dynamic Programming is part of AlgoFox Pro
You can read the whole course outline here. The exercises are in the app, along with your streak, your mistake review, and the progress that carries across your devices.
Pro starts with a 3 day free trial. The app store decides who is eligible for an introductory offer, and a lapsed subscription does not get another one.
Already subscribed in the app? Sign in with the same account and Pro works here too. Quick Play and Battle are free on the web, and so is the first course in every subject.