Coding
Find the 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)).
Input: nums1 = [1, 2], nums2 = [3, 4]
Output: 2.5
Explanation: The merged array is [1, 2, 3, 4]. The median is the average of the two middle elements: (2 + 3) / 2 = 2.5.
Was asked at