Series: Word Distance & Follow-up Posted on August 4, 2018July 26, 2020 by braindenny 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 CheatSheet: Leetcode For Code Interview CheatSheet: Common Code Problems & Follow-ups See all edit distance problems & follow-up: #editdistance LeetCode: Wildcard MatchingLeetCode: Valid Palindrome IIILeetCode: Shortest Word Distance IIILeetCode: Shortest Word Distance IILeetCode: Shortest Word DistanceLeetCode: Shortest Common SupersequenceLeetCode: Regular Expression MatchingLeetCode: One Edit DistanceLeetCode: Minimum ASCII Delete Sum for Two StringsLeetCode: Longest Palindromic SubsequenceLeetCode: Longest Common SubsequenceLeetCode: Edit DistanceLeetCode: Distinct SubsequencesLeetCode: Delete Operation for Two Strings See more blog posts. Post Views: 6