Reverse Linked List
Solution ApproachWas this helpful?
Easy•linked-list•Expected: O(n) time, O(1) space
linked-list
Problem
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]
Reference solution unlocks after your first submission
Loading...