# Partition Labels Last Occurrence (Practice 5062): Sketch
Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
Record the last index of each character; cut whenever the running max last-index equals i.
```python
def partition_labels(s):
last={c:i for i,c in enumerate(s)};res=[];start=end=0
for i,c in enumerate(s):
end=max(end,last[c])
if i==end: res.append(end-start+1);start=i+1
return res
```
## Complexity
Linear in the dominant input size for the scan; heap/tree variants add a log factor.
## Interview pitfalls
State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.
## Practicing out loud
Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see AI interview assistant.