Given an integer array arr of length n that contains a permutation of the values from $0$ to $n - 1$, split arr into the maximum number of contiguous chunks.

After splitting, sort each chunk individually and then concatenate the sorted chunks in their original order. Return the largest possible number of chunks such that the final concatenated array is fully sorted in nondecreasing order.

Constraints:

• n == arr.length

• $1 \leq$ n $\leq 10$

• $0 \leq$ arr[i] $<$ n

• All elements of arr are unique.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.