# Surrounded Regions: Explained
Surrounded Regions shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Mark every 'O' connected to the border (BFS/DFS or Union-Find), then flip the unmarked interior 'O's to 'X'.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(mn).
## Common mistake
Flipping a region as soon as a DFS sees it is closed on three sides, missing a later border leak.
## 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 www.linkjob.ai.