Given an integer array nums, return the maximum length of a semi decreasing subarray. If no such subarray exists, return $0$.

A subarray starting at index l and ending at index r is considered semi decreasing if l $<$ r and nums[l] $>$ nums[r]. The length of this subarray is r $-$ l $+$ $1$.

Constraints:

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

• $-10^9 \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.