You are given an array of integers nums of size n containing nonnegative integers.

In one operation, you can perform the following actions:

1. Select a contiguous subarray nums[l..r] and an integer $x > 0$ such that every element in the subarray satisfies nums[i] $\geq x$ for all $l \leq i \leq r$.

2. Set nums[i] to $0$ for all indices $i$ in the range $[l, r]$ where nums[i] == x.

Return the minimum number of operations required to convert all elements in nums to $0$.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^5$

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.