Practice Find Peak Element

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#162

LeetCode Problem

Find Peak Element

Array Binary Search

Problem Statement

A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array. You must write an algorithm that runs in O(log n) time.

Source: Find Peak Element on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

nums = [1,2,3,1]

Output

# Example 2

Input

nums = [1,2,1,3,5,6,4]

Output

Constraints

1 <= nums.length <= 1000

-2^31 <= nums[i] <= 2^31 - 1

nums[i] != nums[i + 1] for all valid i.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free