# Partition Labels: Practice Notes

Partition Labels shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Partition s into as many pieces as possible so each letter appears in at most one piece. Record the last index of every char; scan i..end, extending end to last[s[i]], and cut when i == end.

## 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

Cutting as soon as a letter's first run ends, which can split a later occurrence of the same letter.

## 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 AI assistant for technical interviews.