AppliedAIPrep logoAppliedAI/Prep
← Coding & DSA / 57
hardGoogleMetaAmazon

Median of Two Sorted Arrays in O(log(m+n)).

This famously-hard problem wants better than the O(m+n) merge: an O(log) binary search on the partition. The signal is binary-searching the split point so the left halves stay below the right halves. Here is the answer.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

This famously-hard problem wants better than the O(m+n) merge: an O(log) binary search on the partition. The signal is binary-searching the split point so the left halves stay below the right halves. Here is the answer.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew
UP NEXT ON YOUR JOURNEY
Next in this trackDecode Ways: count the decodings of a digit string (1D DP).Next in this trackLongest Palindromic Substring (expand around center).Next in this trackImplement the Adam optimizer from scratch.
DISCUSSION · 0

No comments yet — be the first to share your approach.