Search
⌘K
Leetcode 852. Peak Index in a Mountain Array
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.
Asked at:
SoFi
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late June, 2025
SoFi
Mid-level
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.