Sort An Array of 0s, 1s and 2s
Posted: 17 Nov, 2020
You have been given an array/list ARR consisting of ‘N’ elements. Each element in the array is either 0, 1 or 2.
Now, your task is to sort this array/list in increasing order. For example, if ARR = [0, 2, 1, 1], then after sorting ARR must look like [0, 1, 1, 2].
The first line contains an integer ‘T’ denoting the number of test cases. Then each test case follows. The first line of each test case contains a positive integer ‘N’ which represents the length of the array/list. The second line of each test case contains ‘N’ single space-separated integers representing the elements of the array/list.
For each test case, the only line of output will print ‘N’ single space-separated integers of the sorted array/list. Print the output of each test case in a separate line.
You are not required to print the expected output; it has already been taken care of. Just implement the function.
1 <= T <= 100 1 <= N <= 5000 0 <= ARR[i] <= 2 Time limit: 1 sec
Game of 3
Posted: 11 Jul, 2021
Lexicographic Permutation Rank
Posted: 13 Jul, 2021
Zero Pair Sum
Posted: 22 Jul, 2021
Implement a Queue
Posted: 27 Jul, 2021
Remove K Corner Elements
Posted: 31 Jul, 2021