Skip to main content

Questions Categories Patterns Progress

CodeTutor - Coding Interview Preparation

Reverse Linked List | CodeTutor

Reverse Linked List

Easy

Linked Lists Recursion LinkedList In-Place Reversal

Problem

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

Constraints

The number of nodes in the list is in the range [0, 5000]
-5000 <= Node.val <= 5000

Examples

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

Output: [5,4,3,2,1]

The list 1→2→3→4→5 becomes 5→4→3→2→1.

Input: head = [1,2]

Output: [2,1]

The list 1→2 becomes 2→1.

Input: head = []

Output: []

An empty list remains empty when reversed.

Loading...

Loading Python...