# Convex Hull Trick Monotone Queries: Explained
Convex Hull Trick Monotone Queries shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Keep lower or upper hull lines in a deque and pop from the front as the query slope or x-coordinate moves monotonically.
## 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(n) after sorting if both slopes and queries are monotone.
## Common mistake
Inserting lines out of slope order into a deque that assumes monotonicity.
## 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.