Reorder List
You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → Ln. Reorder the list to be on the following form: L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → …

30:00

Reorder List
medium
Topics
Companies

You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → Ln. Reorder the list to be on the following form: L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → …

Example 1:
Input: {"head":[1,2,3,4]}
Output: [1,4,2,3]
Constraints:

  • The number of nodes is in the range [1,5×104][1, 5 \times 10^4].

  • 1≤Node.val≤10001 \leq \text{Node.val} \leq 1000

Input
arr ={"head":[1,2,3,4]}

Find middle: slow=head, fast=head.next

slow ↓

1

fast ↓

2

3

4

NULL
Variables
No variables to display
DepthFunction Call
Stack empty
0/8