Add solution #2111

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,754 LeetCode solutions in JavaScript
+# 1,755 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1617,6 +1617,7 @@
 2108|[Find First Palindromic String in the Array](./solutions/2108-find-first-palindromic-string-in-the-array.js)|Easy|
 2109|[Adding Spaces to a String](./solutions/2109-adding-spaces-to-a-string.js)|Medium|
 2110|[Number of Smooth Descent Periods of a Stock](./solutions/2110-number-of-smooth-descent-periods-of-a-stock.js)|Medium|
+2111|[Minimum Operations to Make the Array K-Increasing](./solutions/2111-minimum-operations-to-make-the-array-k-increasing.js)|Hard|
 2114|[Maximum Number of Words Found in Sentences](./solutions/2114-maximum-number-of-words-found-in-sentences.js)|Easy|
 2115|[Find All Possible Recipes from Given Supplies](./solutions/2115-find-all-possible-recipes-from-given-supplies.js)|Medium|
 2116|[Check if a Parentheses String Can Be Valid](./solutions/2116-check-if-a-parentheses-string-can-be-valid.js)|Medium|

solutions/2111-minimum-operations-to-make-the-array-k-increasing.js

@@ -0,0 +1,58 @@
+/**
+ * 2111. Minimum Operations to Make the Array K-Increasing
+ * https://leetcode.com/problems/minimum-operations-to-make-the-array-k-increasing/
+ * Difficulty: Hard
+ *
+ * You are given a 0-indexed array arr consisting of n positive integers, and a positive integer k.
+ *
+ * The array arr is called K-increasing if arr[i-k] <= arr[i] holds for every index i, where
+ * k <= i <= n-1.
+ *
+ * - For example, arr = [4, 1, 5, 2, 6, 2] is K-increasing for k = 2 because:
+ *   - arr[0] <= arr[2] (4 <= 5)
+ *   - arr[1] <= arr[3] (1 <= 2)
+ *   - arr[2] <= arr[4] (5 <= 6)
+ *   - arr[3] <= arr[5] (2 <= 2)
+ * - However, the same arr is not K-increasing for k = 1 (because arr[0] > arr[1]) or k = 3 (because
+ *   arr[0] > arr[3]).
+ *
+ * In one operation, you can choose an index i and change arr[i] into any positive integer.
+ *
+ * Return the minimum number of operations required to make the array K-increasing for the given k.
+ */
+
+/**
+ * @param {number[]} arr
+ * @param {number} k
+ * @return {number}
+ */
+var kIncreasing = function(arr, k) {
+  let result = 0;
+  for (let i = 0; i < k; i++) {
+    const subsequence = [];
+    for (let j = i; j < arr.length; j += k) {
+      subsequence.push(arr[j]);
+    }
+    result += longestNonDecreasingSubsequence(subsequence);
+  }
+
+  return result;
+
+  function longestNonDecreasingSubsequence(nums) {
+    const tails = [];
+    for (const num of nums) {
+      let left = 0;
+      let right = tails.length;
+      while (left < right) {
+        const mid = Math.floor((left + right) / 2);
+        if (tails[mid] <= num) {
+          left = mid + 1;
+        } else {
+          right = mid;
+        }
+      }
+      tails[left] = num;
+    }
+    return nums.length - tails.length;
+  }
+};