Add solution #768

Author: JoshCrozier

README.md

@@ -582,6 +582,7 @@
 765|[Couples Holding Hands](./0765-couples-holding-hands.js)|Hard|
 766|[Toeplitz Matrix](./0766-toeplitz-matrix.js)|Easy|
 767|[Reorganize String](./0767-reorganize-string.js)|Medium|
+768|[Max Chunks To Make Sorted II](./0768-max-chunks-to-make-sorted-ii.js)|Hard|
 783|[Minimum Distance Between BST Nodes](./0783-minimum-distance-between-bst-nodes.js)|Easy|
 784|[Letter Case Permutation](./0784-letter-case-permutation.js)|Medium|
 790|[Domino and Tromino Tiling](./0790-domino-and-tromino-tiling.js)|Medium|

solutions/0768-max-chunks-to-make-sorted-ii.js

@@ -0,0 +1,34 @@
+/**
+ * 768. Max Chunks To Make Sorted II
+ * https://leetcode.com/problems/max-chunks-to-make-sorted-ii/
+ * Difficulty: Hard
+ *
+ * You are given an integer array arr.
+ *
+ * We split arr into some number of chunks (i.e., partitions), and individually sort each chunk.
+ * After concatenating them, the result should equal the sorted array.
+ *
+ * Return the largest number of chunks we can make to sort the array.
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {number}
+ */
+var maxChunksToSorted = function(arr) {
+  const stack = [];
+
+  for (const num of arr) {
+    if (stack.length === 0 || stack[stack.length - 1] <= num) {
+      stack.push(num);
+    } else {
+      const max = stack.pop();
+      while (stack.length && stack[stack.length - 1] > num) {
+        stack.pop();
+      }
+      stack.push(max);
+    }
+  }
+
+  return stack.length;
+};