You are given an array target consisting of distinct integers and an integer array arr.

In a single operation, you can insert any integer at any position of arr. You may perform this operation any number of times.

Return the minimum number of operations required to make target a subsequence of arr.

Note: A subsequence of an array is a sequence derived by deleting zero or more elements from the array without altering the relative order of the remaining elements.

Constraints:

• $1 \leq$ target.length, arr.length $\leq 10^5$

• $1 \leq$ target[i], arr[i] $\leq 10^9$

• target contains no duplicates.

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.