Practice Coding Question | Real Coding Interviews

Quick Summary

Partition the array into the maximum number of contiguous segments where the last element is strictly less than the segment's maximum.
Every parcel must be assigned to exactly one segment, requiring a complete and non-overlapping partition.
The optimal count is achieved by finalizing a segment as soon as the balance condition is met.

What This Tests

Common Patterns

Greedy

Test Cases

Input

Output

Expected