Solution: Find Peak Element
Explore the modified binary search technique to efficiently identify any peak element in an integer array. This lesson teaches you how to apply a logarithmic time algorithm by comparing middle elements and narrowing the search range, helping you master peak finding problems common in coding interviews.
We'll cover the following...
Statement
You’re given a 0-indexed integer array nums. An index i is called a peak if nums[i] is strictly greater than its neighboring values (the elements immediately to its left and right, if they exist). Assume the array has virtual boundaries where nums[-1] = nums[n] = -∞, so the first and last elements can also be peaks.
Your task is to return the index of any one peak element (if there are multiple peaks, any valid peak index is acceptable), and your solution must run in
Constraints:
...