Add solution #1574

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,377 LeetCode solutions in JavaScript
+# 1,378 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1201,6 +1201,7 @@
 1569|[Number of Ways to Reorder Array to Get Same BST](./solutions/1569-number-of-ways-to-reorder-array-to-get-same-bst.js)|Hard|
 1572|[Matrix Diagonal Sum](./solutions/1572-matrix-diagonal-sum.js)|Easy|
 1573|[Number of Ways to Split a String](./solutions/1573-number-of-ways-to-split-a-string.js)|Medium|
+1574|[Shortest Subarray to be Removed to Make Array Sorted](./solutions/1574-shortest-subarray-to-be-removed-to-make-array-sorted.js)|Medium|
 1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](./solutions/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js)|Medium|
 1598|[Crawler Log Folder](./solutions/1598-crawler-log-folder.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|

solutions/1574-shortest-subarray-to-be-removed-to-make-array-sorted.js

@@ -0,0 +1,43 @@
+/**
+ * 1574. Shortest Subarray to be Removed to Make Array Sorted
+ * https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/
+ * Difficulty: Medium
+ *
+ * Given an integer array arr, remove a subarray (can be empty) from arr such that the remaining
+ * elements in arr are non-decreasing.
+ *
+ * Return the length of the shortest subarray to remove.
+ *
+ * A subarray is a contiguous subsequence of the array.
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {number}
+ */
+var findLengthOfShortestSubarray = function(arr) {
+  const n = arr.length;
+  let left = 0;
+
+  while (left < n - 1 && arr[left] <= arr[left + 1]) {
+    left++;
+  }
+
+  if (left === n - 1) return 0;
+
+  let right = n - 1;
+  while (right > 0 && arr[right - 1] <= arr[right]) {
+    right--;
+  }
+
+  let minLength = Math.min(n - left - 1, right);
+
+  for (let i = 0, j = right; i <= left && j < n; i++) {
+    while (j < n && arr[i] > arr[j]) {
+      j++;
+    }
+    minLength = Math.min(minLength, j - i - 1);
+  }
+
+  return minLength;
+};