HardAcceptance: 25.9%
3. Median of Two Sorted Arrays
Description
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)).
Examples
Example 1
Input: nums1 = [1,3], nums2 =
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.
Constraints
- •nums1.length == m
- •nums2.length == n
- •0 <= m <= 1000
- •0 <= n <= 1000
Topics
ArrayBinary SearchDivide and Conquer
💡 Tip: Start with a brute force solution and then optimize. Don't worry about performance initially.
Want more challenges?
Explore more coding challenges and improve your problem-solving skills
Browse All Challenges →