You are given two integer arrays of equal length, nums1 and nums2.

In a single operation, you may swap the values nums1[i] and nums2[i] at any chosen index i.

Return the minimum number of operations needed to make both nums1 and nums2 strictly increasing.

Note: The test cases are generated such that it is always possible to make both sequences strictly increasing.

Constraints:

• $2 \leq$ nums1.length $\leq 10^5$

• nums2.length $=$ nums1.length

• $0 \leq$ nums1[i], nums2[i] $\leq 2 imes 10^5$

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.