Move Zeroes to End

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

Input:

The input provided consists of multiple test cases. For each test case:

An integer ‘N’ is provided, denoting the size of the array.

Following this, there are ‘N’ integers which represent the elements of the array.

Output:

For each test case, after performing the required modification, output the resulting array.

Example:

Input:

1 10 0 1 -2 3 4 0 5 -27 9 0

Output:

1 -2 3 4 5 -27 9 0 0 0

Constraints:

1

Question

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

The input provided consists of multiple test cases. For each test case:

An integer ‘N’ is provided, denoting the size of the array.
Following this, there are ‘N’ integers which represent the elements of the array.

For each test case, after performing the required modification, output the resulting array.

1
10
0 1 -2 3 4 0 5 -27 9 0

1 -2 3 4 5 -27 9 0 0 0

Implement the function as required; no need to handle the input/output operations explicitly.

Accepted Answer

Move all zeroes in an unsorted array to the end while preserving 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: [0, 1, -2, 3, 4, 0, 5, -27, 9, 0], Output: [1, -2, 3, 4, 5, -27, 9, 0, 0, 0]