# Search A 2D Matrix: Walkthrough
Search A 2D Matrix shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Treat the matrix as a virtual sorted array of length m*n and binary-search the mid index, mapping it back to (mid//n, mid%n).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log(mn)).
## Common mistake
Binary searching each row separately, which is slower than one search on the flattened view.
## 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.