Given two strings word1 and word2, return the minimum number of operations needed to transform word1 into word2.

The following three operations are allowed on any character of a word:

• Insert a character

• Delete a character

• Replace a character

Constraints:

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

• word1 and word2 consist of 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.