# Reorder List: Study Guide

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

## Key idea

Split at the middle, reverse the second half, then weave first, last, second, second-last by alternating next pointers.

## 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) extra O(1).

## Common mistake

Building a new list of values instead of rewiring, or weaving without reversing so the tail order is wrong.

## 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 official website.