Given two integer arrays nums1 and nums2, sorted in nondecreasing order, return the minimum integer value that is common to both arrays. If there is no common integer between them, return $-1$.

Constraints:

• $1 \leq$ nums1.length, nums2.length $\leq 10^5$

• $1 \leq$ nums1[i], nums2[j] $\leq 10^9$

• Both nums1 and nums2 are sorted in nondecreasing order.

Now, 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.

Implement your solution in the following coding playground.