HardBinary Search
Median of Two Sorted Arrays
googleamazonmetaapplemicrosoftgoldman-sachsbloomberg
Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
The overall run time complexity should be O(log(m + n)).
Example 1:
Input: nums1 = [1,3], nums2 = [2]
Output: 2.0
Explanation: merged array = [1,2,3] and median is 2.
Example 2:
Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.5
Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
Examples
Example 1
Input: nums1 = [1,3], nums2 = [2]
Output: 2.0
Explanation: The merged sorted array is [1,2,3]. The median is 2.
Example 2
Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.5
Explanation: The merged sorted array is [1,2,3,4]. The median is (2 + 3) / 2 = 2.5.
Example 3
Input: nums1 = [0,0], nums2 = [0,0]
Output: 0.0
Explanation: The merged sorted array is [0,0,0,0]. The median is 0.
Constraints
- -nums1.length == m
- -nums2.length == n
- -0 <= m <= 1000
- -0 <= n <= 1000
- -1 <= m + n <= 2000
- --10^6 <= nums1[i], nums2[i] <= 10^6
Optimal Complexity
Time
O(log(min(m, n)))
Space
O(1)
One problem, two ways to prep
Choose between solo practice and interview simulation
Practice Mode keeps things simple with code + tests. AI Interview Mode adds voice, pressure, and a post-round score summary.