New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Sort Linked List

Contributed by

Prateek_18cb

Medium

0/80

Avg time to solve 20 mins

Success Rate 80 %

5 upvotes

Problem Statement

You are given a linked list of 'N' nodes where nodes can contain values 0, 1, and 2 only. Your task is to sort the linked list.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input format :

The first line of input contains an integer ‘T’ denoting the number of test cases.
The first line of each test case contains 'N'(number of nodes in the linked list) space-separated integers representing the value of each node. -1 at the end denotes NULL pointer.

For example : 
The input 0 1 2 -1 denotes a linked list containing 3 nodes represented as:

Output format :

For each test case, in a separate line, print the final sorted linked list.

Note :

You don’t have to print anything; it has already been taken care of. Just implement the given function.

Constraints :

1 <= T <= 5
1 <= N <= 100000
0 <= data <= 2

 where ‘T’ is the total number of test cases, 'N' is the total number of nodes in the linked list and ‘data’ is the value of any node of the linked list.

Sample Input 1 :

2
0 1 1 2 2 1 1 1 0 1 -1
2 2 2 1 0 -1

Sample Output 1 :

0 0 1 1 1 1 1 1 2 2 
0 1 2 2 2

Explanation of The Sample Input 1 :

For the first test case :
The given linked list is :
0 -> 1 ->  1 ->  2 -> 2 -> 1 -> 1 -> 1 -> 0 -> 1 -> null

Therefore after sorting the list will become :
0 -> 0 ->  1 ->  1 -> 1 -> 1 -> 1 -> 1 -> 2 -> 2 -> null

For the second test case :
The given linked list is :
2 -> 2 ->  2 ->  1 -> 0 -> null

Therefore after sorting the list will become-
0 -> 1 ->  2 ->  2 -> 2 -> null

Sample Input 2 :

3
0 0 0 -1
0 1 1 2 2 -1
2 2 2 2 2 0 -1

Sample Output 2 :

0 0 0
0 1 1 2 2 
0 2 2 2 2 2

Auto

Console