Move Zeroes to End

Given an unsorted array of integers, rearrange the elements such that all the zeroes are moved to the end, while maintaining the order of non-zero elements.

Input:

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

Output:

For each test case, rearrange the array in-place and provide the modified array on a new line.

Example:

Input:

T = 1
N = 10
array = [0, 1, -2, 3, 4, 0, 5, -27, 9, 0]

Output:

[1, -2, 3, 4, 5, -27, 9, 0, 0, 0]

Constraints:

1

Question

Move Zeroes to End

Given an unsorted array of integers, rearrange the elements such that all the zeroes are moved to the end, while maintaining the order of non-zero elements.

Input:

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

Output:

For each test case, rearrange the array in-place and provide the modified array on a new line.

Example:

Input:

T = 1
N = 10
array = [0, 1, -2, 3, 4, 0, 5, -27, 9, 0]

Output:

[1, -2, 3, 4, 5, -27, 9, 0, 0, 0]

Constraints:

1 <= T <= 50
1 <= N <= 10⁶
-10000 <= A[i] <= 10000
Time Limit: 1 sec

Note:

No need to print in the function; just perform the required operations to modify the array.

Accepted Answer

Given an unsorted array of integers, move all zeroes to the end while maintaining the order of non-zero elements.

Iterate through the array and maintain two pointers, one for the current position and one for the position to swap with.
If the current element is non-zero, swap it with the element at the swap pointer and increment the swap pointer.
After iterating through the array, fill the remaining positions with zeroes.
Example: Input array [0, 1, -2, 3, 4, 0, 5, -27, 9, 0] should be rearranged to [1, -2, 3, 4, 5, -27, 9, 0, 0, 0].