Find peak element
A peak element is one strictly greater than its neighbors; out-of-bounds neighbors are treated as negative infinity. Given an integer array nums where no two adjacent elements are equal, return the index of any peak element in O(log n) time. Array length up to 1e5.
Implement
find_peak_element(nums: list[int]) → intExamples
in
[[1,2,3,1]]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 18 min
solution.py
InputExpectedGot
[[1,2,3,1]]2not run yetsample