Back to Question
Reorder List
Question Explain
Given a singly linked list, reorder it in-place such that $L_0 \to L_n \to L_1 \to L_{n-1} \to \dots$. This requires multiple steps: find middle, reverse, and merge.
Start Trying This Question Simulation
Click "Start Speaking" and answer the question naturally.