Given two integer arrays arr1 and arr2, return the minimum number of operations needed to make arr1 strictly increasing.

In one operation, you can choose any element in arr1 and replace it with any element from arr2.

If it is impossible to make arr1 strictly increasing, return $-1$.

Constraints:

• $1 \leq \text{arr1.length}, \text{arr2.length} \leq 2000$

• $0 \leq \text{arr1[i]}, \text{arr2[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.