LeetCode 583: Delete Operation for Two Strings
Problem Restatement We are given two strings, word1 and word2 . In one step, we may delete exactly one character from either string. We need to return the minimum number of deletion steps required to make the two strings equal. The strings contain only lowercase English letters, and each length is between 1 and 500 . Input and Output Item Meaning word1 First lowercase English string word2 Second lowercase English...