# Sort List: Practice Notes
Sort List shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Merge-sort a linked list: slow/fast to split, sort each half, then merge two sorted lists. Heap/array sort uses extra space the follow-up wants you to avoid.
## 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 log n) extra O(log n) recursion or O(1) bottom-up.
## Common mistake
Using a random-access sort that needs O(n) extra arrays, which the follow-up asks you not to.
## 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 real-time interview help.