Given two strings word1 and word2, return the minimum number of deletion steps required to make word1 and word2 the same.

In each step, you can delete exactly one character from either string.

Constraints:

• $1 \leq$ word1.length, word2.length $\leq 500$

• word1 and word2 consist of only lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.