Median of Two Sorted Arrays — Hard Coding Interview Question

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

Input: nums1 = [1,3], nums2 = [2]

Output: 2.0

Constraints

• nums1.length == m
• nums2.length == n
• 0 ≤ m, n ≤ 1000
• 1 ≤ m + n ≤ 2000
• -10⁶ ≤ nums1[i], nums2[i] ≤ 10⁶

Topics & Companies

Topics: binary-search, arrays

Asked by: Google, Amazon, Meta, Microsoft

Optimal Solution Complexity

Time complexity: O(log(min(m, n))). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns