You’re given two sorted integer arrays, nums1 and nums2, of size $m$ and $n$, respectively. Your task is to return the median of the two sorted arrays.

The overall run time complexity 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$

• $-10^5 \leq$ nums1[i], nums2[i] $\leq 10^5$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Note: As an additional challenge, we have intentionally hidden the solution to this puzzle.

Implement your solution in the following coding playground.