# Find All Groups Of Farmland: Walkthrough
Find All Groups Of Farmland shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A 0/1 grid marks farmland as 4-connected rectangles of 1s. Scan top-left to bottom-right; when you hit a 1 that starts a group, walk right and down to the group's opposite corner (the rectangle is solid), record [r1,c1,r2,c2], and zero the rectangle so you do not recount it.
## 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(mn).
## Common mistake
DFS-flooding every cell without remembering it is a rectangle, or missing that groups never touch even at corners in the problem statement — still treat 4-adjacent 1s as the same group.
## 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 https://linkjob.ai.