Problem of the day
The first line of input contains a single integer ‘T’ representing the number of test cases.
The first line of each test case contains a single integer ‘N’ representing the size of the array. The second line of each test case contains ‘N’ integers representing the elements of the array.
For each test case, modify the input array and print the output in a new line
You don’t need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 50
1 <= N <= 10^6
-10000 <= A[i] <= 10000
Where ‘T’ is the number of test cases, ‘N’ is the size of the array, A[i] is the value of the element present at the ith index.
Time Limit:1sec
2
7
2 0 4 1 3 0 28
5
0 0 0 0 1
2 4 1 3 28 0 0
1 0 0 0 0
In the first testcase, All the zeros are moved towards the end of the array, and the non-zero elements are pushed towards the left, maintaining their order with respect to the original array.
In the second testcase, All zero are moved towards the end, hence the only non-zero element i.e 1 is in the starting of the array
2
5
0 3 0 2 0
4
0 0 0 0
3 2 0 0 0
0 0 0 0