0769-max-chunks-to-make-sorted.js

/**
 * 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;
};