Dynamic Programming
Character-by-Character Analysis
Subsequence vs Substring Distinctions
Two String LCS
Multiple String LCS
LCS Reconstruction
Contiguous Character Matching
Multiple String Extensions
Levenshtein Distance
Operation Cost Variations
Edit Sequence Reconstruction
Longest Palindromic Subsequence
Longest Palindromic Substring
Palindrome Partitioning
Wildcard Pattern Matching
Regular Expression Matching
Interleaving Strings
Previous
6. Grid-Based Dynamic Programming
Go to top
Next
8. Knapsack Problem Variants