Skip to main content
135101113233034target=13Found?O(log(m×n)) time
mediumGrind 75

Search a 2D Matrix

Binary search is the tool here, but the real test is whether your invariant stays crisp. Interviewers love it because it reveals your boundary precision and your edge-case discipline. Interviewers care more about airtight boundaries than speed here.

Arrays & HashingBinary Search

Learn this pattern

Arrays and Hashing Interview Questions

Arrays and hashing problems are about fast lookup choices: set for membership, map for attached state, and buckets when counts are bounded. Reach for this family when brute force compares too many pairs or when you need to remember what you saw earlier in one pass.

Coco
Fin

Meet your coaches

Talk through the problem while you code. Signed-in reps become prep memory for the next session.

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
1Search Sorted 2D Matrixmedium
Based onLeetCode

Desktop required

Sorry - mobile cannot run the editor and tests yet. Use the next step below or email yourself a link to continue on desktop.

Read the pattern guide

Arrays and Hashing Interview Questions gives you a useful next rep while you are still on your phone.