If the given list is {1 -> -2 -> 3} (which is sorted on absolute value), the returned list should be {-2 -> 1 -> 3}.
The first line of input contains a single integer ‘T’, representing the number of test cases or queries to be run. Then the T test cases follow.
The first line of each test case contains the elements of the singly linked list separated by a single space and terminated by -1. Hence, -1 would never be a list element.
It is guaranteed that the given list is sorted based on absolute value.
For each test case, print the sorted linked list. The elements of the sorted list should be single-space separated, terminated by -1.
The output of each test case is printed in a separate line.
You don't need to print the output, it has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= 'N' <= 5 * 10^4
-10^9 <= 'data' <= 10^9 and 'data' != -1
Where 'N' denotes the number of elements in the Singly Linked List and 'data' represents the value of those elements.
Time Limit : 1 sec
We will use the ‘Merge Sort’ algorithm to sort the given linked list. Merge Sort is a Divide and Conquer algorithm. In this algorithm, we will divide the list into two parts, recursively sort the two parts and finally merge them such that the resultant list will be sorted.
In the given list all non-negative values are present in sorted order but all negative values are present in reverse order. We have to reverse the negative values and move it before the first non-negative value.
For example, say the given list is {0-> 1 -> -2 -> 3 -> -4}. In this list, non-negative values {0, 1, 3} are present in sorted order and the negative values {-2, -4} are present in reverse order.
So, we traverse the list and if we encounter a negative value node, we will move this node before the head node and this node will become the new head of the list. After doing this for all negative values, we will have a sorted list.
Max Prefix
Merge Two Sorted Arrays Without Extra Space
Merge Two Sorted Arrays Without Extra Space
Delete Nodes On Regular Intervals
Add One To Linked List
Sort 0s, 1s, 2s