# Largest Magic Square: Explained
Largest Magic Square shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A k x k magic square has equal row, column, and both diagonal sums. Prefix-sum rows and columns and try k from n down to 1; for each top-left verify the 2k+2 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^3) to O(n^4) depending on verification.
## Common mistake
Checking only rows and columns and skipping diagonals, or requiring every integer 1..k^2 (the problem allows any positives, not a traditional 1..k^2 magic square).
## 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.