Longest Common Subsequence: DP Solution and Space Optimization
3 min read Longest Common Subsequence (LCS) is a fundamental string DP problem that appears in interviews at Google, Microsoft, and Amazon — […] Read article
Dynamic Programming
Dynamic Programming
Edit Distance (Levenshtein): DP Solution Explained
3 min read Edit Distance (Levenshtein Distance) is a classic string DP problem that appears in interviews at Google, Microsoft, and Dropbox. It’s Read article
Dynamic Programming
Word Break Problem: Dynamic Programming Solution
2 min read Word Break (LeetCode 139) is a string DP problem that tests whether you can partition a string using a given Read article