Max Chunks To Make Sorted

Partition a permutation of [0..n-1] into the maximum number of chunks such that sorting each chunk and concatenating yields the fully sorted array. The core challenge is finding valid cut points (positions where the prefix maximum equals the current index) that allow greedy partitioning.