Peak Element Algorithm | Dataford Interview Questions

Given an array of integers, write an algorithm to find the peak element where the element is greater than its neighbors.

Return the index of any valid peak element. Treat an array boundary as having only its existing neighbor, assume adjacent values are distinct, and guarantee that the input is non-empty.

Implement def find_peak(nums):, where nums is a list of integers and the return value is an integer index.

Constraints

1 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
Adjacent values are distinct
The input array is non-empty
Return any valid peak index

Function Signature

def find_peak(nums):

Your question is Peak Element Algorithm. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem