FastPrep
Problem · Array

Find Peak Element

● MediumMetaPHONE SCREEN
See Meta hiring insights

Based on the source, the other question being asked was -

Given an array of positive integers and target, return True if sum of continues array equal to target.

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.

Examples
01 · Example 1
nums = [1,2,3,1]
return = 2

3 is a peak element and your function should return the index number 2.

02 · Example 2
nums = [1,2,1,3,5,6,4]
return = 5

Your function can return either index number 1 where the peak element is 2, or index number 5 where the peak element is 6.

Constraints
  • 1 <= nums.length <= 1000
  • -2^31 <= nums[i] <= 2^31 - 1
  • nums[i] != nums[i + 1] for all valid i.
More Meta problems
drafts saved locally
public int findPeakElement(int[] nums) {
  // write your code here (You may want to refer to LC 162)
}
nums[1,2,3,1]
expected2
sign in to submit