Solution: Find Peak Element
Explore how to locate a peak element in an array by applying a modified binary search technique. This lesson guides you through the algorithm that narrows down the search space while ensuring O(log n) time complexity and constant space. Understand the step-by-step logic to identify a peak and implement an efficient solution suitable for coding interviews.
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 ...