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: Wildcard Matching
- 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.