Solution: Find Peak Element
Explore how to find a peak element in a 0-indexed array by applying a modified binary search algorithm. Understand how to narrow down search boundaries by comparing middle elements to their right neighbors, ensuring an O(log n) time complexity and O(1) space usage. This lesson helps you confidently implement an efficient peak finding solution.
We'll cover the following...
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 ...