Word Distance & Follow-up

**Questions**

Name | Example |
---|---|

`s1[i...], s2[j...]` vs `s1[0...i], s2[0...j]` |
`s1[i]` vs `s1[i-1]` , Space `O(min(n, m)))` vs Space `O(n*m)` |

Whether we need to the active initialization | Leetcode: Longest Common Subsequence |

Space complexity: O(n*m) or O(min(n, m)) | Leetcode: Shortest Common Supersequence |

See all edit distance problems & follow-up: #editdistance

- Leetcode: Valid Palindrome III
- Leetcode: Shortest Word Distance III
- Leetcode: Shortest Word Distance II
- Leetcode: Shortest Word Distance
- Leetcode: Shortest Common Supersequence
- Leetcode: Regular Expression Matching
- Leetcode: One Edit Distance
- Leetcode: Minimum ASCII Delete Sum for Two Strings
- Leetcode: Longest Palindromic Subsequence
- Leetcode: Longest Common Subsequence
- Leetcode: Edit Distance
- Leetcode: Distinct Subsequences
- Leetcode: Delete Operation for Two Strings

See more blog_posts.