# Maximal Rectangle: Study Guide

Maximal Rectangle shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Treat each row as the base of a histogram whose bar heights are consecutive 1s above that cell. After updating heights, run largest-rectangle-in-histogram (monotonic stack) on that row.

## 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(m n).

## Common mistake

Only looking at square submatrices (maximal square) or restarting a 2-D stack from scratch without the histogram reduction.

## 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 AI coding interview assistant.