Easy
Quiz
#206 Reverse Linked List
APPROACH
Given the head of a singly linked list, reverse it and return the new head.
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: []
1 of 4
1:00
What is the optimal approach for this problem?