# Shortest Unsorted Continuous Subarray: Study Guide
Shortest Unsorted Continuous Subarray shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find the farthest inversion from left and right, or sort a copy and compare bounds.
## 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 answer, sliding window, stack, or in-place rewrite) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n) or O(n log n).
## Common mistake
Stopping at the first inversion instead of the farthest one.
## 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 interview copilot app.