You are given a $0$ indexed integer array nums consisting of distinct elements.

In a single operation, you can remove either the first element or the last element of nums.

Return the minimum number of deletions needed to remove both the minimum element and the maximum element from the array.

Constraints:

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

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

• The integers in nums are distinct.

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.