# Median Of Two Sorted Arrays: Interview Notes
Median Of Two Sorted Arrays shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary search the partition of the shorter array so the left sides of both arrays contain half the elements and max(left) <= min(right).
## 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 min(m,n)).
## Common mistake
Merging both arrays, which is O(m+n) and not the intended log-time solution.
## 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 interview assistant.