Leetcode 2148. Count Elements With Strictly Smaller and Greater Elements

Count how many elements have both a strictly smaller and a strictly greater element in the array — equivalently, count elements whose value is strictly between the array's global minimum and maximum. Duplicates in that middle range are counted, while elements equal to the min or max are excluded.