minimum-operations-to-make-a-subsequence

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

You are given an array <code>target</code> that consists of distinct integers and another integer array <code>arr</code> that can have duplicates.

In one operation, you can insert any integer at any position in <code>arr</code>. For example, if <code>arr = [1,4,1,2]</code>, you can add <code>3</code> in the middle and make it <code>[1,4,3,1,2]</code>. Note that you can insert the integer at the very beginning or end of the array.

Return the minimum number of operations needed to make <code>target</code> a subsequence of <code>arr</code>.

A subsequence of an array is a new array generated from the original array by deleting some elements (possibly none) without changing the remaining elements&#39; relative order. For example, <code>[2,7,4]</code> is a subsequence of <code>[4,2,3,7,2,1,4]</code> (the underlined elements), while <code>[2,4,2]</code> is not.

&nbsp;
Example 1:

<pre>
Input: target = [5,1,3], <code>arr</code> = [9,4,2,3,4]
Output: 2
Explanation: You can add 5 and 1 in such a way that makes <code>arr</code> = [5,9,4,1,2,3,4], then target will be a subsequence of <code>arr</code>.
</pre>

Example 2:

<pre>
Input: target = [6,4,8,1,3,2], <code>arr</code> = [4,7,6,2,3,8,6,1]
Output: 3
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= target.length, arr.length &lt;= 105</code></li>
	<li><code>1 &lt;= target[i], arr[i] &lt;= 109</code></li>
	<li><code>target</code> contains no duplicates.</li>
</ul>