Reorder List Problem (Interview Question)

[myraO]

Hi,

Can someone help me to solve this question asked in microsoft interview from Interviewbit.

Given a singly linked list

    L: L0 → L1 → … → Ln-1 → Ln,
reorder it to:

    L0 → Ln → L1 → Ln-1 → L2 → Ln-2 → …
You must do this in-place without altering the nodes’ values.

For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.

Any pointers will do help.

Thanks.

[jmcilhinney]

The CodeBank forums are for sharing working code snippets, not for asking questions. I have asked the mods to move this thread to the C# forum. Please don't create a duplicate thread in the meantime.

[jmcilhinney]

As for the question, have you made any attempt at all? Have you at least tried to develop an algorithm, even if not code to implement it?