# Find Peak Element II: Interview Notes

Find Peak Element II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A 2D peak is greater than its 4-neighbors (edges have fewer). Binary search columns: in the mid column pick the row with the max value; if its right neighbor is bigger, search right, else if left is bigger search left, else it is a peak.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(m log n).

## Common mistake

Scanning the whole matrix (works but not the intended log factor) or comparing only left/right and ignoring the vertical max choice.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at undetectable AI interview copilot.