You are given an integer array arr.

You need to partition arr into the maximum number of contiguous chunks such that sorting each chunk individually and then concatenating them in order results in a completely sorted array.

Return the maximum number of chunks that can be formed.

Constraints:

• $1 \leq$ arr.length $\leq 2000$

• $0 \leq$ arr[i] $\leq 10^8$

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.