Reorder List
Solution ApproachWas this helpful?
Medium•linked-list•Expected: O(n) time, O(1) space
linked-list
Problem
Given a singly linked list L0→L1→...→Ln, reorder it to L0→Ln→L1→Ln-1→... in-place.
Example 1:
Input: head = [1, 2, 3, 4]
Output: [1, 4, 2, 3]
Example 2:
Input: head = [1, 2, 3, 4, 5]
Output: [1, 5, 2, 4, 3]
Reference solution unlocks after your first submission
Loading...