LeetCode 763 Partition Labels - Why Naive Fails

Try all ways to partition and check if each letter stays in one part.

With length $n$, there are $2^{n-1}$ ways to place partition boundaries. Checking each is expensive.

Can you find where each partition must end?