Median of two sorted arrays of same size(Java Program)

[ManavArora26]

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.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
1 <= m + n <= 2000
-106 <= nums1[i], nums2[i] <= 106

[dev-x-Aryan]

Can I work on this? @ManavArora26

[Aditi192002]

Please assign me this issue.

[abhijeet-crypto]

i want to work on this

[PawangRai]

Please assign this issue to me

[Teju-1212]

I know this problem

[aniketkumar-1907]

Can I work on this problem I have done it before @ManavArora26 ?