Leetcode 1713. Minimum Operations to Make a Subsequence

Reduce arr to the sequence of positions of its elements in target (ignoring elements not in target); the problem then becomes finding the longest strictly increasing subsequence of that index sequence, and the minimum insertions equals target.length minus that LIS (compute LIS in O(n log n) for the given constraints).