Reverse Linked List

Beginner

Reverse a linked list in-place using three pointers: prev, curr, and next. At each step, flip the curr node's pointer to point backward.

time:O(n)

space:O(1)

⚡ +100_XP

step[1/12]

> Start

Reverse linked list [1 → 2 → 3 → 4 → 5]. Use three pointers: prev, curr, next. In-place, O(1) space.

// tap NEXT STEP to walk through one step at a time