Given an array, move all zeroes to the end of the array while maintaining the relative order of the non-zero elements. For example, Input: 1 2 0 0 7 4 42 0 0 0 6 Output: 1 2 7 4 42 6 0 0 0 0 0

Question

Accepted Answer

Sort an array by moving all zeroes to the end.

Iterate through the array and move all non-zero elements to the front.
Count the number of zeroes encountered and append them at the end of the array.
Use two pointers to swap elements and maintain the order.

Accepted Answer

Initially, make a function and pass array and number of elements of array(n) to the function.

Inside the function, declare and define a variable as counter equal to 0.

Run the for loop for traversing the array for n elements. If ith element of array is not equal to 0 i.e. (arr[i]!=0), then store that element in arr[ctr] (that basically is responsible for a new array) and increase the counter ctr by 1.

when the whole array is traversed, then use the while loop for the remaining elements of the array till n and store 0 into arr[ctr], thereby increasing the ctr by 1.

void pushZeroesToEnd(int arr[],int n)

{

int ctr=0;

for(int i=0;i

if(arr[i]!=0){

arr[ctr]=arr[i];

ctr++;

}

while(ctr

arr[ctr++]=0;

}

Given an array, move all zeroes to the end of the array while maintaining the relative order of the non-zero elements. For example, Input: 1 2 0 0 7 4 42 0 0 0 6 Output: 1 2 7 4 42 6 0 0 0 0 0

SAP Software Developer interview questions & answers

Popular interview questions of Software Developer

Top HR questions asked in SAP Software Developer