Search⌘ K
AI Features

Problem: Find Peak Element

Discover how to identify a peak element in an integer array using a binary search approach. Learn to implement an algorithm that runs in logarithmic time by comparing middle elements with neighbors, refining your understanding of efficient searching methods and algorithmic optimization.

Statement

A peak element in an array is one that is strictly greater than both of its neighbors.

Given a 00-indexed integer array nums, return the index of any peak element.

Note: Elements at the boundaries of the array are compared against -\infty. That is, nums[-1] and nums[n] are both treated as -\infty, where n is the length of nums. This means an element can be considered a peak if it only needs to be greater than its single existing neighbor at the edges. Additionally, no two adjacent elements in nums are equal. You must write ...