You are given two strings initial and target.

In one operation, you can perform either of the following actions on the current string:

• Add any character to the front or back of the string.

• Remove the character at the front or back of the string.

Return the minimum number of operations required to transform initial into target.

Constraints:

• $1 \leq$ initial.length, target.length $\leq 1000$

• initial and target 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.