🎉 Excited to share that I successfully tackled the "Median of Two Sorted Arrays" problem today! 🚀
This problem challenges you to find the median of two sorted arrays, with the constraint of achieving an overall run time complexity of O(log (m+n)).
Here's a brief overview of the problem:
Given two sorted arrays nums1 and nums2 of sizes m and n respectively, the task is to return the median of the two sorted arrays.
Example:
For nums1 = [1,3] and nums2 = [2], the output should be 2.00000, as the merged array would be [1,2,3] and the median is 2.
For nums1 = [1,2] and nums2 = [3,4], the output should be 2.50000, as the merged array would be [1,2,3,4] and the median is (2 + 3) / 2 = 2.5.
I'm thrilled to have solved this problem and eager to take on more challenges in the future! 💪
Business Development Team Manager - Europe
2moCongratulations and wish you all the success!