X

DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Reorder List
Hard Accuracy: 49.92% Submissions: 35330 Points: 8

Given a singly linked list: A0A1→…→An-1An, reorder it to: A0AnA1An-1A2An-2→…
For example: Given 1->2->3->4->5 its reorder is 1->5->2->4->3.

Note: It is recommended do this in-place without altering the nodes' values.

Example 1:

Input:
Output: 1 3 2


Example 2:

Input:
Output: 1 4 7 3.

The task is to complete the function reorderList() which should reorder the list as required. The reorder list is automatically printed by the driver's code.

Note: Try to solve without using any auxilliary space.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

Constraints:
1 <= N <= 104