# Partition List: Walkthrough

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

## Key idea

Build two dummy lists, less-than-x and greater-or-equal, walk once appending each node to the right bucket, then join the less tail to the greater head and null the new tail.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Sorting the whole list, which rearranges equal-to-x nodes more than the stable partition allows.

## 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 try it free.