Given an integer array arr, determine the length of the shortest contiguous subarray that can be removed such that the remaining elements are in nondecreasing order.

Note: A subarray is a contiguous sequence of elements within an array.

Constraints:

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

• $0 \leq$ arr[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.