Problem: Median of Two Sorted Arrays

Statement

You are given two sorted arrays, nums1 of size m and nums2 of size n. Your task is to find and return the median of the combined elements from both arrays.

Note: The expected overall runtime complexity of your solution should be $O(\log(m + n))$.

Constraints:

• nums1.length $== $ m

• nums2.length $== $ n

• $0 \leq$ m $\leq 1000$

• $0 \leq$ n $\leq 1000$

• $1 \leq$ m $+$ n $\leq 2000$

• ...