Reorder List
Rearrange the nodes into the order: first, last, second, second-to-last, third, third-to-last, and so on. For 1 -> 2 -> 3 -> 4 -> 5 the answer is 1 -> 5 -> 2 -> 4 -> 3. 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]
returns [1,4,2,3]
1, 4, 2, 3.
Example 2
head [1,2,3,4,5]
returns [1,5,2,4,3]
1, 5, 2, 4, 3.
Constraints
0 <= 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 Between PositionsMedium
- 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