Leetcode 583. Delete Operation for Two Strings

Find the minimum number of single-character deletions across two strings to make them identical; this reduces to computing their longest common subsequence (LCS), with the answer = len(word1)+len(word2)-2*LCS, typically solved via O(n*m) dynamic programming for lengths up to 500.