You are given two integer arrays nums1 and nums2 of length n, where nums2 is a permutation of nums1.

In one operation, you can choose any contiguous subarray of nums1, extract it, and insert it at any position within the remaining elements.

Return the minimum number of operations required to transform nums1 into nums2.

Constraints:

• $2 \leq$ n $==$ nums1.length $==$ nums2.length $\leq 6$

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

• nums2 is a permutation of nums1.

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.