Given two strings s and part, repeatedly remove the leftmost occurrence of part from s until s no longer contains part as a substring. Return the final string after all removals.

Constraints:

• $1 \leq$ s.length $\leq 1000$

• $1 \leq$ part.length $\leq 1000$

• s and part 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.