Problem title
Difficulty
Avg time to solve

LCA of three Nodes
Easy
20 mins
Sum Of Infinite Array
Moderate
35 mins
Pair Sum
Easy
15 mins
Reverse The Array
Easy
15 mins
Sum or Product
Easy
15 mins
Two Sum
Easy
10 mins
Find Duplicate in Array
Easy
15 mins
Flower Shop
Easy
--
Sort 0 1 2
Easy
22 mins
Maximum Subarray Sum
Hard
35 mins
438

# Sort 0 1 2

Difficulty: EASY
Contributed By
Avg. time to solve
22 min

Problem Statement

#### You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

##### Note :
``````Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
``````
##### Input format :
``````The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.

The first line of each test case contains an Integer 'N' denoting the size of the array/list.

The second line of each test case contains 'N' space-separated Integers denoting the array/list.
``````
##### Output format :
``````For each test case/query, print the sorted array/list(ARR) as space-separated Integers.

Output for every test case will be printed in a separate line.
``````
##### Note:
``````You need to change in the given array/list itself. Hence, no need to return or print anything.
``````
##### Constraints :
``````1 <= T <= 10
1 <= N <= (5 * (10 ^ 5))
0 <= ARR[i] <= 2

Where 'N' is the size of the given array/list.
And, ARR[i] denotes the i-th element in the array/list.

Time Limit: 1sec
``````
##### Sample Input 1 :
``````2
6
0 1 2 2 1 0
7
0 1 2 1 2 1 2
``````
##### Sample Output 1 :
``````0 0 1 1 2 2
0 1 1 1 2 2 2
``````
##### Sample Input 2 :
``````2
7
2 2 2 1 1 1 0
6
2 1 2 0 1 0
``````
##### Sample Output 2 :
``````0 1 1 1 2 2 2
0 0 1 1 2 2
``````
Console