Leetcode 3690. Split and Merge Array Transformation

Given two length-n arrays where nums2 is a permutation of nums1, find the minimum number of operations that cut out any contiguous subarray from nums1 and reinsert it (in original order) at any position to transform nums1 into nums2. In other words, compute the minimum number of contiguous block-move (cut-and-paste) operations needed to convert one permutation into the other (n ≤ 6).