You are given an integer array nums. In a single step, remove every element nums[i] for which nums[i - 1] > nums[i] holds, where $1 \leq i <$ nums.length. All such removals in a step occur simultaneously.

Repeat this process until the array becomes non decreasing.

Return the number of steps required to make nums non decreasing.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^9$

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.