Problem 56 of 75

Find Peak Element

MediumNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

A peak element is strictly greater than its neighbors (nums[-1] and nums[n] are -∞). Given nums where no two adjacent elements are equal, return the index of any peak, in O(log n) time.

[1,2,3,1] → 2 [1,2,1,3,5,6,4] → 1 or 5

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Find Peak Element, explainedNeetCodeIO