Rearrange Odd and Even Position Nodes in Linked List

Rearrange a linked list such that all nodes at odd positions are together, followed by all nodes at even positions. You need to return the head of the reorganized linked list without displaying the elements.

Input:

Line 1: Linked list elements of length n (separated by space and terminated by -1)

Output:

Updated list elements (separated by space)

Example:

Input:

1 2 3 4 5 -1

Output:

1 3 5 2 4

Constraints:

1

Question

Rearrange Odd and Even Position Nodes in Linked List

Rearrange a linked list such that all nodes at odd positions are together, followed by all nodes at even positions. You need to return the head of the reorganized linked list without displaying the elements.

Input:

Line 1: Linked list elements of length n (separated by space and terminated by -1)

Output:

Updated list elements (separated by space)

Example:

Input:

1 2 3 4 5 -1

Output:

1 3 5 2 4

Constraints:

1 <= n < 10^4

Accepted Answer

The task is to rearrange a linked list such that all odd position nodes are together and all even position nodes are together.

Create two separate linked lists, one for odd position nodes and one for even position nodes.
Traverse the original linked list and add the nodes to their respective lists based on their position.
Join the two lists together by pointing the last node of the odd list to the head of the even list.
Return the head of the odd list as the updated linked list.

Rearrange Odd and Even Position Nodes in Linked List

Input:

Output:

Example:

Input:

Output:

Constraints:

Top Rupeek Software Developer interview questions & answers

Popular interview questions of Software Developer

Top HR questions asked in Rupeek Software Developer