104. Reverse a Linked List

Easy

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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

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

Explanation: The original list 1->2->3->4->5 is reversed to 5->4->3->2->1.

Example 2:

Input: head = [1,2]

Output: [2,1]

Explanation: The original list 1->2 is reversed to 2->1.

Example 3:

Input: head = []

Output: []

Explanation: An empty list remains empty after reversal.

Constraints:

•
•

Time Complexity

O(n)

Space Complexity

O(1)

104. Reverse a Linked List

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

104. Reverse a Linked List

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases