Sort 0 1 2 Problem Statement

Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

Input:

The first line contains an integer 'T' representing the number of test cases. Each test case consists of two lines. The first line contains an integer 'N', the size of the array. The second line contains 'N' space-separated integers, the elements of the array.

Output:

For each test case, output the sorted array as space-separated integers in a new line.

Example:

Input: 2 5 0 2 1 2 0 3 2 1 0 Output: 0 0 1 2 2 0 1 2

Constraints:

1 ≤ T ≤ 10

1 ≤ N ≤ 5 * 10⁵

0 ≤ arr[i] ≤ 2

Time Limit: 1 sec

Note:

Try to solve the problem using a single scan over the array. You need to modify the array in-place and do not return anything.

Question

Sort 0 1 2 Problem Statement

Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

Input:

The first line contains an integer 'T' representing the number of test cases. Each test case consists of two lines. The first line contains an integer 'N', the size of the array. The second line contains 'N' space-separated integers, the elements of the array.

Output:

For each test case, output the sorted array as space-separated integers in a new line.

Example:

Input:
2
5
0 2 1 2 0
3
2 1 0
Output:
0 0 1 2 2
0 1 2

Constraints:

1 ≤ T ≤ 10
1 ≤ N ≤ 5 * 10⁵
0 ≤ arr[i] ≤ 2
Time Limit: 1 sec

Note:

Try to solve the problem using a single scan over the array. You need to modify the array in-place and do not return anything.

Accepted Answer

Sort an array of 0s, 1s, and 2s in linear time complexity.

Use three pointers to keep track of 0s, 1s, and 2s while iterating through the array.
Swap elements based on the values encountered to sort the array in-place.
Ensure to handle edge cases like all 0s, all 1s, and all 2s in the array.