Problem Statement
Given two strings word1 and word2, return the minimum number of operations to convert word1 into word2. Allowed operations: insert, delete, replace. Target Complexity: Time: O(m*n) Space: O(min(m,n)) extra (optimized DP) Edge cases: One string empty Identical strings Large lengths