Search⌘ K
AI Features

Find Peak Element

Explore how to find a peak element in a 0-indexed integer array where the peak is greater than neighboring values. Learn to apply modified binary search to achieve an O(log n) time complexity, refining your approach to advanced array problems in coding interviews.

Statement

You’re given a 0-indexed integer array nums. An index i is called a peak if ...