Problem 1713 · Hard

Minimum Operations to Make a Subsequence

Map the array onto the target positions and keep the longest strictly increasing run of positions with binary search.

Open the interactive visualisation