# Partition Array Into Disjoint Intervals: Walkthrough

Partition Array Into Disjoint Intervals shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Split nums into a prefix and suffix (both nonempty) so every left value is <= every right value; return the smallest left length. Track the max of the prefix and the running min of a candidate right; or precompute suffix minima and grow the left while left_max <= suffix_min[i+1].

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Sorting the array (destroys the required original order) or returning any valid split instead of the smallest left.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at https://linkjob.ai.