Hudson River Trading SWE Interview Question 2024 October | Divide and Conquer | on-campus

Question 1: Median of Two Sorted Arrays Problem Statement Given two sorted arrays nums1 and nums2 of sizes m and n respectively, return the median of the two sorted arrays. The overall run time complexity must be O(log(m+n)). Constraints nums1.length == m, nums2.length == n 0 <= m, n <= 1000 1 <= m + n <= 2000 -106 <= nums1[i], nums2[i] <= 106 Examples Example 1: Input: nums1 = [1,3], nums2 = [2] Output: 2.00000 Explanation 1: Merged sorted ...