Problem - Median of Two Sorted Arrays

Given two sorted arrays $nums1$ and $nums2$, return the median of the combined sorted array. The solution must run in $O(\log(m + n))$ time.

This is LeetCode $4$, one of the oldest hard problems. The logarithmic requirement rules out merging the arrays. You need binary search, but not on the arrays directly.