Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3690. Split and Merge Array Transformation
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source