# Find Peak Element: Interview Notes
Find Peak Element shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary search on slope: if nums[mid] < nums[mid+1], a peak exists on the right; otherwise one exists on the left (including mid).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log n).
## Common mistake
Scanning for the global max, which is correct but linear.
## 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 linkjob.ai.