Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.