Practice Reverse Linked List
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given the head of a singly linked list, reverse the list, and return the reversed list. Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both?
Source: Reverse Linked List on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
head = [1,2,3,4,5]
Output
[5,4,3,2,1]
# Example 2
Input
head = [1,2]
Output
[2,1]
# Example 3
Input
head = []
Output
[]
Constraints
The number of nodes in the list is the range [0, 5000].
-5000 <= Node.val <= 5000
Related LeetCode Problems
Practice more problems similar to Reverse Linked List.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.