Mozilla-Campus-Club-Cummins / HacktoberFest23_MozillaCCEW

0 stars 0 forks source link

Median of two sorted array. #35

Closed Vaishnavi-gaikawad closed 11 months ago

Vaishnavi-gaikawad commented 11 months ago

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 0(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.

akanksha1131 commented 11 months ago

Kindly please assign this to me. Akanksha Kale, TY IT Cummins

Vaishnavi-gaikawad commented 11 months ago

@akanksha1131 You can work on this issue.

akanksha1131 commented 11 months ago

Hi, I cant seem to find the contributors.md file. Can you please assist me with this?

On Tue, 17 Oct 2023, 19:01 Vaishnavi-gaikawad, @.***> wrote:

@akanksha1131 https://github.com/akanksha1131 You can work on this issue.

— Reply to this email directly, view it on GitHub https://github.com/Mozilla-Campus-Club-Cummins/HacktoberFest23_MozillaCCEW/issues/35#issuecomment-1766426032, or unsubscribe https://github.com/notifications/unsubscribe-auth/A3R6DD2KHELNZOALMV2EZ6TX72CCHAVCNFSM6AAAAAA5YFOSZSVHI2DSMVQWIX3LMV43OSLTON2WKQ3PNVWWK3TUHMYTONRWGQZDMMBTGI . You are receiving this because you were mentioned.Message ID: <Mozilla-Campus-Club-Cummins/HacktoberFest23_MozillaCCEW/issues/35/1766426032 @github.com>