Reverse Linked List II
Solution ApproachWas this helpful?
Medium•linked-list•Expected: O(n) time, O(1) space
linked-list
Problem
Given the head of a singly linked list and two integers left and right, reverse the nodes from position left to position right.
Example 1:
Input: head = [1, 2, 3, 4, 5], left = 2, right = 4
Output: [1, 4, 3, 2, 5]
Example 2:
Input: head = [5], left = 1, right = 1
Output: [5]
Reference solution unlocks after your first submission
Loading...