Dynamic ProgrammingEvidence Contributing
String Alignment / Subsequence DP
2D DP over two string indices to compare, align, or count subsequences/substrings between them.
Practice Problems: 7
Difficulty: 0 Easy·5 Medium·2 Hard
Core technique
Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.
- Core Strategy: 2D DP over two string indices to compare, align, or count subsequences/substrings between them.