Add solution #769

Author: JoshCrozier

README.md

@@ -583,6 +583,7 @@
 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|
+769|[Max Chunks To Make Sorted](./0769-max-chunks-to-make-sorted.js)|Medium|
 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/0769-max-chunks-to-make-sorted.js

@@ -0,0 +1,30 @@
+/**
+ * 769. Max Chunks To Make Sorted
+ * https://leetcode.com/problems/max-chunks-to-make-sorted/
+ * Difficulty: Medium
+ *
+ * You are given an integer array arr of length n that represents a permutation of the integers
+ * in the range [0, n - 1].
+ *
+ * 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) {
+  let result = 0;
+
+  for (let i = 0, max = 0; i < arr.length; i++) {
+    max = Math.max(max, arr[i]);
+    if (max === i) {
+      result++;
+    }
+  }
+
+  return result;
+};