# Insertion Sort List: Interview Notes

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

## Key idea

Dummy sorted head; for each node, walk the already-sorted prefix to the insertion point and splice it in. The original next must be saved first.

## 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^2).

## Common mistake

Inserting into a new array and rebuilding, which hides the pointer-splicing the problem is testing.

## 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 interview assistant.