Back to Practice Dashboard
Top 150 InterviewHard

Median of Two Sorted Arrays

Learn how to solve the 'Median of Two Sorted Arrays' problem. This detailed resource details brute force and optimized approaches.

Problem Statement

Hard

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)).

Write a function findMedianSortedArrays(nums1: List[int], nums2: List[int]) -> float.

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

Examples

Example 1
Input
nums1 = [1, 3], nums2 = [2]
Output
2.0
Explanation

Merged array = [1, 2, 3]. The median is 2.0.

Example 2
Input
nums1 = [1, 2], nums2 = [3, 4]
Output
2.5
Explanation

Merged array = [1, 2, 3, 4]. The median is (2 + 3) / 2 = 2.5.

Need a Hint?
Analyze the input constraints. Try sorting first (O(n log n)) or using a hash map/set to track seen elements in O(n) time.
Edge Cases to Watch
  • Empty list or null input variables
  • Single item lists/arrays
  • Extremely large input bounds causing integer or stack overflow

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor