Loading…
Median of Two Sorted Arrays is a hard coding interview question covering arrays, binary search — the kind asked at FAANG (Facebook/Meta, Apple, Amazon, Netflix, Google) and AI-first companies like Anthropic, OpenAI, and Nvidia.
Given two sorted arrays nums1 (size m) and nums2 (size n), return the median of the two combined sorted arrays.
Example: nums1=[1,3], nums2=[2] -> 2.0 Example: nums1=[1,2], nums2=[3,4] -> 2.5
Solve in O(log(min(m,n))) time. Binary search on the shorter array. This is one of the most difficult binary search problems.
Solution walkthrough on Pro
Upgrade to Pro to unlock the guided hints, the step-by-step walkthrough, solutions in Python, C++, Java, and Go, and complexity analysis.
What's inside this guide
Fully unlocked, no account needed — solutions, walkthroughs and follow-up answers included.
Or start the Study Plan — a week-by-week order for your loop, and week 1 is entirely free.
A full interview loop is more than one round. These are the others, each with what is on the site for it.