Available question text
Given an array that strictly increases then strictly decreases (a mountain array), find the index of the peak (maximum) element in O(log n) time by exploiting the array's unimodal property with binary search.
Related questions
Continue with questions that share topics or the same question type.
- Find in Mountain Array
Coding
- Find the Middle Index in Array
Coding
- Longest Mountain in Array
Coding · Array · Dynamic Programming · Enumeration
- Maximum Value at a Given Index in a Bounded Array
Coding
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
SoFi
Leetcode 852. Peak Index in a Mountain Array
Reported Jun 30, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source