CodingMediumcod-g565

Subject Binary searchLevel Mid–Senior~18 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]) → int

Examples

in[[1,2,3,1]]out2

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.