Add solution #915

Author: JoshCrozier

README.md

@@ -725,6 +725,7 @@
 912|[Sort an Array](./solutions/0912-sort-an-array.js)|Medium|
 913|[Cat and Mouse](./solutions/0913-cat-and-mouse.js)|Hard|
 914|[X of a Kind in a Deck of Cards](./solutions/0914-x-of-a-kind-in-a-deck-of-cards.js)|Medium|
+915|[Partition Array into Disjoint Intervals](./solutions/0915-partition-array-into-disjoint-intervals.js)|Medium|
 916|[Word Subsets](./solutions/0916-word-subsets.js)|Medium|
 918|[Maximum Sum Circular Subarray](./solutions/0918-maximum-sum-circular-subarray.js)|Medium|
 922|[Sort Array By Parity II](./solutions/0922-sort-array-by-parity-ii.js)|Easy|

solutions/0915-partition-array-into-disjoint-intervals.js

@@ -0,0 +1,34 @@
+/**
+ * 915. Partition Array into Disjoint Intervals
+ * https://leetcode.com/problems/partition-array-into-disjoint-intervals/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums, partition it into two (contiguous) subarrays left and right so that:
+ * - Every element in left is less than or equal to every element in right.
+ * - left and right are non-empty.
+ * - left has the smallest possible size.
+ *
+ * Return the length of left after such a partitioning.
+ *
+ * Test cases are generated such that partitioning exists.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var partitionDisjoint = function(nums) {
+  let leftMax = nums[0];
+  let currentMax = nums[0];
+  let partitionIndex = 0;
+
+  for (let i = 1; i < nums.length; i++) {
+    if (nums[i] < leftMax) {
+      partitionIndex = i;
+      leftMax = currentMax;
+    }
+    currentMax = Math.max(currentMax, nums[i]);
+  }
+
+  return partitionIndex + 1;
+};