Reverse Between Positions
Positions start at 1 for the head. Reverse the nodes from position left to position right (both included) and leave every other node where it is. Return the head. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [1,2,3,4,5]
left 2
right 4
returns [1,4,3,2,5]
2, 3, 4 become 4, 3, 2.
Example 2
head [7,8]
left 1
right 1
returns [7,8]
Reversing one node changes nothing.
Constraints
1 <= left <= right <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Reverse Even Length GroupsMedium
- Reverse the Second HalfMedium
- Rotate ListMedium
- Sort ListMedium
- Split Linked List in PartsMedium
- Swap Kth From Start and EndMedium
- Where the Cycle StartsMedium
- Complete the MirrorHard