Given an array of integers A of size N that is a permutation of [0, 1, 2, …, (N-1)],
if we split the array into some number of “chunks” (partitions), and individually sort each chunk.
After concatenating them, the result equals the sorted array.
What is the most number of chunks we could have made?
The only argument given is the integer array A.
Return the maximum number of chunks that we could have made.
1 <= N <= 100000 0 <= A[i] < N
Input 1: A = [1, 2, 3, 4, 0] Output 1: 1 Input 2: A = [2, 0, 1, 3] Output 2: 2
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.