Available question text
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).
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 1713. Minimum Operations to Make a Subsequence
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source