Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2733. Neither Minimum nor Maximum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source