# Shortest Subarray To Be Removed To Make Array Sorted: Walkthrough
Shortest Subarray To Be Removed To Make Array Sorted shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find the longest non-decreasing prefix and suffix. Then two-pointer merge them to the longest pair (prefix_end, suffix_start) with arr[l] <= arr[r]; the removed middle is the answer.
## 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).
## Common mistake
Checking every removal window, which is O(n^2).
## 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.