Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Median of Two Sorted Arrays
Bookmark
Merge and Find Middle
Two Pointer Count
Binary Search on Partition
Binary Search on Value
Input
Example 1
Even total
Odd total
All zeros
No overlap
Custom
nums1
=
[1, 3, 5]
,
nums2
=
[2, 4, 6, 8]
nums1
0
1
1
3
2
5
nums2
0
2
1
4
2
6
3
8
nums1
0
1
1
3
2
5
nums2
0
2
1
4
2
6
3
8
Merge both arrays; the median sits at the middle of 7 elements
nums1
0
1
1
3
2
5
nums2
0
2
1
4
2
6
3
8
Merged 1 of 7. 1 from nums1.
nums1
0
1
1
3
2
5
nums2
0
2
1
4
2
6
3
8
Merged 2 of 7. 2 from nums2.
nums1
0
1
1
3
2
5
nums2
0
2
1
4
2
6
3
8
Merged 3 of 7. 3 from nums1.
nums1
0
1
1
3
2
5
nums2
0
2
1
4
2
6
3
8
Merged 5 of 7. 5 from nums1.
nums1
0
1
1
3
2
5
nums2
0
2
1
4
2
6
3
8
Merged 6 of 7. nums1 is exhausted, copy 6 from nums2.
nums1
0
1
1
3
2
5
nums2
0
2
1
4
2
6
3
8
Merged 7 of 7. nums1 is exhausted, copy 8 from nums2.
nums1
0
1
1
3
2
5
nums2
0
2
1
4
2
6
3
8
Odd total: median = 4
nums1
0
1
1
3
2
5
nums2
0
2
1
4
median
2
6
3
8
Odd total: median = 4
nums1
0
1
1
3
2
5
nums2
0
2
1
4
median
2
6
3
8
algo
master
.
io
Step:
Find the median of [1,3,5] and [2,4,6,8] by merging
0 / 10
Input
Example 1
Even total
Odd total
All zeros
No overlap
Custom
nums1
=
[1, 3, 5]
,
nums2
=
[2, 4, 6, 8]
0 / 10
algo
master
.
io
Step:
Find the median of [1,3,5] and [2,4,6,8] by merging
