Series: Word Distance & Follow-up Posted on August 4, 2018December 13, 2019 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 Subsequence See more blogposts. Post Views: 6