Available question text
Given a mountain (strictly increasing then strictly decreasing) array accessible only via a limited-call MountainArray interface, return the smallest index where the value equals target or -1 if absent. The challenge is to minimize get calls (<=100) by first locating the peak and then binary-searching the increasing and decreasing halves.
Related questions
Continue with questions that share topics or the same question type.
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
- Find All Duplicates in an Array
Coding
- Find All K-Distant Indices in an Array
Coding
- Find All Lonely Numbers in the Array
Coding · Array · Counting · Hash Table
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 1095. Find in Mountain Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source