# Most Stones Removed With Same Row Or Column: Walkthrough
Most Stones Removed With Same Row Or Column shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Union-Find stones that share a row or a column; you can remove all but one stone per component, so the answer is n minus the number of components.
## 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(n).
## Common mistake
Removing a stone only when another stone is in the exact same cell, which never happens.
## 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 the Linkjob AI app.