# Largest Plus Sign: Walkthrough

Largest Plus Sign shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each cell, the plus arm length is the min of consecutive 1s looking left, right, up, and down. Four linear sweeps fill those four arrays; the answer is the max of those mins (order of the plus).

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

## Common mistake

BFS from every cell or checking expanding arms independently without reusing the sweep, which is too slow when mines are sparse.

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