# Closest Prime Numbers In Range: Explained
Closest Prime Numbers In Range shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sieve primes up to right, then scan adjacent primes in [left, right] for the minimum gap. Return [-1,-1] if fewer than two exist.
## 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(R log log R).
## Common mistake
Trial-dividing every number in the range when R is 1e6.
## 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.