# Maximum Area Of A Piece Of Cake After Horizontal And Vertical Cuts: Interview Notes

Maximum Area Of A Piece Of Cake After Horizontal And Vertical Cuts shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A h x w cake; horizontalCuts and verticalCuts slice it. The max piece has area (max consecutive horizontal gap, including edges 0 and h) times (max consecutive vertical gap, including 0 and w). Sort the cuts, scan gaps, multiply modulo 1e9+7.

## 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 + m log m).

## Common mistake

Forgetting the gaps from 0 to the first cut and from the last cut to h/w, or adding the max gaps instead of multiplying.

## 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 linkjob.ai.