Leetcode 2733. Neither Minimum nor Maximum

Given an array of distinct positive integers, return any element that is neither the global minimum nor the global maximum, or -1 if no such element exists. Essentially determine whether there's a value strictly between the array's min and max and return any one if present.