<p>Given two strings <code>word1</code> and <code>word2</code>, return <em>the minimum number of <strong>steps</strong> required to make</em> <code>word1</code> <em>and</em> <code>word2</code> <em>the same</em>.</p>

<p>In one <strong>step</strong>, you can delete exactly one character in either string.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> word1 = &quot;sea&quot;, word2 = &quot;eat&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> You need one step to make &quot;sea&quot; to &quot;ea&quot; and another step to make &quot;eat&quot; to &quot;ea&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> word1 = &quot;leetcode&quot;, word2 = &quot;etco&quot;
<strong>Output:</strong> 4
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= word1.length, word2.length &lt;= 500</code></li>
	<li><code>word1</code> and <code>word2</code> consist of only lowercase English letters.</li>
</ul>

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        size1, size2 = len(word1), len(word2)
        dp = [[0 for _ in range(size2 + 1)] for _ in range(size1 + 1)]

        # Fill dp array
        for i in range(size1 + 1):
            for j in range(size2 + 1):
                # If first string is empty, we need to insert all characters of the second string
                if i == 0:
                    dp[i][j] = j

                # If second string is empty, we need to remove all characters of the first string
                elif j == 0:
                    dp[i][j] = i

                # If the last character matches, no additional operation is required
                elif word1[i - 1] == word2[j - 1]:
                    dp[i][j] = dp[i - 1][j - 1]

                # If the last character is different, consider all possibilities and take the minimum
                else:
                    dp[i][j] = 1 + min(dp[i - 1][j], dp[i][j-1])     # Remove

        return dp[size1][size2]

        
19698