You are given two strings word1 and word2 of equal length.

You can partition word1 into one or more non empty contiguous substrings. For each substring, you can perform any number of the following operations:

• Type $1$: Replace any single character in the substring with any lowercase English letter.

• Type $2$: Swap any two characters in the substring.

• Type $3$: Reverse the substring.

Each operation on a substring counts as $1$ operation.

Return the minimum total number of operations required to transform word1 into word2.

Constraints:

• $1 \leq$ word1.length $=$ word2.length $\leq 100$

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