PROBLEM4.md

PROBLEM 4: Median of Two Sorted Arrays

Problem Statement

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)).

Concepts Covered

• Binary Search
• Divide and Conquer

Examples

Input: nums1 = [1, 3], nums2 = [2]
Output: 2.0

Input: nums1 = [1, 2], nums2 = [3, 4]
Output: 2.5

Starter Code

def find_median_sorted_arrays(nums1: list[int], nums2: list[int]) -> float:
    # Implement your solution here
    pass