Solution: Find Peak Element
Understand how to identify a peak element in a 0-indexed integer array by applying a modified binary search approach. This lesson guides you through the step-by-step process of comparing middle elements to neighbors, discarding halves of the array effectively, ensuring an O(log n) solution to find any peak index.
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 ...