Leetcode 2091. Removing Minimum and Maximum From Array

Given an array of distinct integers, find the minimum number of deletions from the front or back needed to remove both the array's minimum and maximum elements. Because deletions only remove ends, the task reduces to choosing the optimal combination of left/right pops based on the positions of the min and max (n up to 1e5).