Median of Two Sorted Arrays
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)).

30:00

Median of Two Sorted Arrays
hard
Topics
Companies

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
Constraints:

  • nums1.length==m\text{nums}_1.\text{length} == m

  • nums2.length==n\text{nums}_2.\text{length} == n

  • 0≤m,n≤10000 \leq m, n \leq 1000

  • 1≤m+n≤20001 \leq m + n \leq 2000

  • −106≤nums1[i],nums2[i]≤106-10^6 \leq \text{nums}_1[i], \text{nums}_2[i] \leq 10^6

Input
arr ={"nums1":[1,3],"nums2":[2]}

Start. Ensure A is smaller array.

nums1

1

3

nums2

2

Variables
No variables to display
DepthFunction Call
Stack empty
0/4

Asked in these interview guides

Company guides that list this problem among their sample questions.

Citadel Software EngineerOptiver Software Engineer