Problem 31 of 75
Reverse Linked List
The problem
Given the head of a singly linked list, reverse the list and return the new head.
[1,2,3,4,5] → [5,4,3,2,1]
Your solution runs against 3 unit tests, including edge and large-value cases.
Loading...
Test console · 3 unit tests
Submit your code to run it against all 3 unit tests. Results appear here.
JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.
Hint
Reference solution
Video explanation
GO DEEPER
The full interview treatment: the conversation, why the approach works, and step-by-step visuals.