Array Partition for Sorted Concatenation | Dataford Interview Questions

Given an array, find the maximum number of chunks you can partition it into so that concatenating the chunks produces the sorted array.

Assume arr is a permutation of the integers from 0 through n - 1. Return the maximum number of contiguous chunks. Each chunk may be sorted independently, and the chunks are then concatenated.

Function: def max_chunks_to_sorted(arr):

Input: A list of distinct integers. Output: An integer count.

Constraints

1 <= len(arr) <= 1000
arr is a permutation of the integers from 0 through len(arr) - 1
Chunks must be contiguous and preserve their original order during concatenation

Function Signature

def max_chunks_to_sorted(arr):

Your question is Array Partition for Sorted Concatenation. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem