Search⌘ K
AI Features

Problem: Find Peak Element

Explore how to implement a binary search algorithm in C# to find a peak element in an array. This lesson helps you understand the problem constraints and apply a logarithmic time solution that efficiently narrows down the search space to locate a peak element while handling edge cases.

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, the virtual positions 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 ...