You are given an integer array nums where every element is either $1$, $2$, or $3$.

In one operation, you can select any index and change its value to any integer from $1$ to $3$, inclusive.

Return the minimum number of operations required to make nums nondecreasing.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 3$

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.