You are given two $0$ indexed integer arrays, nums1 and nums2, both of length n.

In one operation, you can choose an index i such that $0 \leq i < n$ and swap the elements nums1[i] and nums2[i].

Your task is to find the minimum number of operations required to make nums1[n - 1] equal to the maximum element in nums1 and nums2[n - 1] equal to the maximum element in nums2.

Return the minimum number of operations needed to satisfy both conditions, or $-1$ if it is impossible.

Constraints:

• $1 \leq n ==$ nums1.length $==$ nums2.length $\leq 1000$

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

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

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.