Solution: Find Peak Element
Explore how to efficiently locate a peak element in a 0-indexed integer array using modified binary search. Understand the approach of comparing middle elements with their neighbors to narrow down the search space and find any valid peak index in O(log n) time.
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 ...