# Maximal Square: Explained

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

## Key idea

DP[i][j] = side of the largest square whose bottom-right is (i,j). If matrix[i][j] is 1, it is 1 + min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1]); track the global max side and return its square.

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

Confusing this with maximal rectangle (histogram) or taking max instead of min of the three neighbors, which builds illegal squares.

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