# Ternary Search On A Unimodal Function: Walkthrough

Ternary Search On A Unimodal Function shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Compare f(m1) and f(m2) and drop the third that cannot contain the 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(log range).

## Common mistake

Using it on functions with flat regions where it can drop the peak.

## 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 try it free.