Add solution #1713

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,495 LeetCode solutions in JavaScript
+# 1,496 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1320,6 +1320,7 @@
 1710|[Maximum Units on a Truck](./solutions/1710-maximum-units-on-a-truck.js)|Easy|
 1711|[Count Good Meals](./solutions/1711-count-good-meals.js)|Medium|
 1712|[Ways to Split Array Into Three Subarrays](./solutions/1712-ways-to-split-array-into-three-subarrays.js)|Medium|
+1713|[Minimum Operations to Make a Subsequence](./solutions/1713-minimum-operations-to-make-a-subsequence.js)|Hard|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|
 1726|[Tuple with Same Product](./solutions/1726-tuple-with-same-product.js)|Medium|

solutions/1713-minimum-operations-to-make-a-subsequence.js

@@ -0,0 +1,57 @@
+/**
+ * 1713. Minimum Operations to Make a Subsequence
+ * https://leetcode.com/problems/minimum-operations-to-make-a-subsequence/
+ * Difficulty: Hard
+ *
+ * You are given an array target that consists of distinct integers and another integer array
+ * arr that can have duplicates.
+ *
+ * In one operation, you can insert any integer at any position in arr. For example, if
+ * arr = [1,4,1,2], you can add 3 in the middle and make it [1,4,3,1,2]. 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 target a subsequence of arr.
+ *
+ * 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' relative order. For
+ * example, [2,7,4] is a subsequence of [4,2,3,7,2,1,4] (the underlined elements),
+ * while [2,4,2] is not.
+ */
+
+/**
+ * @param {number[]} target
+ * @param {number[]} arr
+ * @return {number}
+ */
+var minOperations = function(target, arr) {
+  const valueToIndex = new Map(target.map((val, i) => [val, i]));
+  const sequence = arr.filter(val => valueToIndex.has(val)).map(val => valueToIndex.get(val));
+
+  const lis = [];
+  for (const index of sequence) {
+    const pos = binarySearch(lis, index);
+    if (pos === lis.length) {
+      lis.push(index);
+    } else {
+      lis[pos] = index;
+    }
+  }
+
+  return target.length - lis.length;
+};
+
+function binarySearch(arr, target) {
+  let left = 0;
+  let right = arr.length;
+
+  while (left < right) {
+    const mid = Math.floor((left + right) / 2);
+    if (arr[mid] < target) {
+      left = mid + 1;
+    } else {
+      right = mid;
+    }
+  }
+
+  return left;
+}