Given an array of integers A, push all the zeroes in the array to the end of the array keeping the order of
all the remaining elements same. More formally, if A[i] and A[j] are two non zero elements and A[i] is in the left
A[j] in the original array then A[i] will be in the left of A[j] in the final answer as well.
Note: Modify the array in place, no extra memory allowed.
The only argument given is the integer array A.
Return the modified array.
1 <= length of the array <= 100000 -10^9 <= A[i] <= 10^9
Input 1: A = [1, 0, 3, 5, 0] Output 1: [1, 3, 5, 0, 0] Input 2: A = [5, 17, 0, 11] Output 2: [5, 17, 11, 0]
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.