Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 768 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 768 # by problem number
lcpy gen -s max_chunks_to_make_sorted_ii # by problem name
arr.
We split arr into some number of chunks (i.e., partitions), and individually sort each chunk. After concatenating them, the result should equal the sorted array.
Return the largest number of chunks we can make to sort the array.
Input: arr = [5,4,3,2,1]
Output: 1
Explanation:
Splitting into two or more chunks will not return the required result.
For example, splitting into [5, 4], [3, 2, 1] will result in [4, 5, 1, 2, 3], which isn't sorted.
Input: arr = [2,1,3,4,4]
Output: 4
Explanation:
We can split into two chunks, such as [2, 1], [3, 4, 4].
However, splitting into [2, 1], [3], [4], [4] is the highest number of chunks possible.
class Solution:
# Time: O(n)
# Space: O(n)
def max_chunks_to_sorted(self, arr: list[int]) -> int:
n = len(arr)
prefix_max = [0] * n
prefix_max[0] = arr[0]
for i in range(1, n):
prefix_max[i] = max(prefix_max[i - 1], arr[i])
suffix_min = [0] * n
suffix_min[n - 1] = arr[n - 1]
for i in range(n - 2, -1, -1):
suffix_min[i] = min(suffix_min[i + 1], arr[i])
chunks = 1
for i in range(n - 1):
if prefix_max[i] <= suffix_min[i + 1]:
chunks += 1
return chunks
| Time | Space |
|---|---|
| O(n) | O(n) |