Rearrange odd and even places
Rearrange and return a linked list in such a way that all odd position nodes are together and all even positions node are together

You just need to return the head of new linked list, don't print the elements.

Input format :

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

Output format :

Updated list elements (separated by space)

Constraints :

1

Question

Rearrange odd and even places

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

Updated list elements (separated by space)

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.

Accepted Answer

Tip 1 : Constant communication
Tip 2 : Give a solution and then optimize it

Accepted Answer

Space Complexity: Explanation: Time Complexity: Explanation:

Top Rupeek Software Developer interview questions & answers