# Check If Grid Can Be Cut Into Sections: Walkthrough

Check If Grid Can Be Cut Into Sections shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Try to cut the rectangles with two horizontal or two vertical lines so each section contains at least one rectangle and none cross a cut.

## 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 log n) after sorting edges.

## Common mistake

Cutting through a rectangle instead of only at gaps.

## 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 learn more.