Median of two sorted arrays

[sassy-bugs]

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

I have already starred and forked the repo, please assign me this issue!
Thanks and Regards.

[durgesh4040]

Please assign this task to me

[Pradyumn04]

Kindly assign me this task with hacktober fest tag

[garvit0908]

Kindly assign this task to me...

[mukul018]

Please assign this task to me with hacktoberfest 2023

[Apoorva-011]

Please assign it to me

[Abiral-2724]

Assign the task to me i will give you the best optimistic solution.

[Deeparawat]

Hey !! assign me this i can quickly fix it.