Скачать или смотреть #4 Median of Two Sorted Arrays | Ultimate Leetcode Challenge

Problem Statement - Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

Example 1:

Input: nums1 = [1,3], nums2 = [2]
Output: 2.00000
Explanation: merged array = [1,2,3] and median is 2.

Example 2:

Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.50000
Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.

Example 3:

Input: nums1 = [0,0], nums2 = [0,0]
Output: 0.00000

Example 4:

Input: nums1 = [], nums2 = [1]
Output: 1.00000

Example 5:

Input: nums1 = [2], nums2 = []
Output: 2.00000


Constraints:

nums1.length == m
nums2.length == n
m = [0, 1000]
n = [0, 1000]
m + n = [1, 2000]
nums1[i], nums2[i] = [-106, 106]


Follow up: The overall run time complexity should be O(log (m+n)).

Link to the problem --- https://leetcode.com/problems/median-...

Also checkout my playlist on Coding Interview Problems ---    • Easiest Coding Interview Problem Ever.  

------------------------------------------------------------------------------------------------

Chapters:

00:00​ The Problem Statement
01:27​​​​ Approach towards the Problem
08:55​​​ Code

#timeenthusiast #ultimateleetcodechallenge #leetcodeinhindi