Skip to main content

Reverse Linked List

Given the head of a singly linked list, reverse the list, and return the reversed list.

Problems21 / 152
Sign in

Reverse Linked List

EASYLinked ListRecursion

Given the head of a singly linked list, reverse the list, and return the reversed list.

Example 1

Input:  head = [1,2,3,4,5]
Output: [5,4,3,2,1]

Example 2

Input:  head = [1,2]
Output: [2,1]
Show hint

Use three pointers: previous, current, and next. Iterate through the list, reversing the links as you go.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
head =
[1,2,3,4,5]
Expected
[5,4,3,2,1]
Run with your own input (JSON)