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 0s, 1s, 2s

Contributed by

Utkarsh Kumar Choubey

Easy

0/40

2 upvotes

Problem Statement

You are given an array ‘arr’ consisting only of 0s , 1s, and 2s.

Sort the given array.

For Example:

For ‘arr’ = {1, 0, 0, 2, 1}.
‘Answer’ = {0, 0, 1, 1, 2}.
‘Answer’ should contain all 0s first, then all 1s and all 2s in the end.

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

Input format:

The first line contains an integer ‘T’, denoting the number of test cases.
For each test case:
The first line contains an integer ‘N’, representing the size of the array ‘arr’.
The second line contains ‘N’ integers, denoting the elements of the array ‘arr’.

Output Format:

For each testcase, return an array ‘Answer’ which contains all the elements of ‘arr’ in sorted order.

Constraints:

1 <=  ‘T’ <= 10^5
1 <= ‘N’ <= 10^5
0 <= ‘arr[i]’ <= 2
Sum of ‘N’ for all testcases <= 10^5

Time Limit: 1 sec

Sample Input 1:

Sample Output 1:

0 1 1 2
0 1 1

Explanation of sample output 1:

For Test 1:
For ‘arr’ = {1, 2, 0, 1}.
‘Answer’ = {0, 1, 1, 2}.
In ‘Answer all 0 is placed first, then all the 1s and finally 2.

For Test 2:
For ‘arr’ = {1, 0, 1}.
‘Answer’ = {0, 1, 1}.
In ‘Answer all 0 is placed first, then all the 1s.

Sample Input 2:

Sample Output 2:

0 1 1 2
1 1 2

Auto

Console