# Maximum White Tiles Covered By A Carpet: Interview Notes

Maximum White Tiles Covered By A Carpet shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Non-overlapping tiles [li, ri] and a carpet of length carpetLen. Sort tiles; slide a window of tiles the carpet can cover and, for each rightmost tile, place the carpet so it ends at that tile's right (or as far as carpetLen allows) and compute covered length with prefix sums.

## 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).

## Common mistake

Placing the carpet only at tile starts without considering a partial last tile.

## 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 this tool.