3_Question.cpp

// Problem Statement –
// A chocolate factory is packing chocolates into the packets. The chocolate packets here represent an array  of N 
// number of integer values. The task is to find the empty packets(0) of chocolate and push it to the end of the 
// conveyor belt(array).

// Example 1 : N=8 and arr = [4,5,0,1,9,0,5,0].

// Input : 8  – Value of N

// [4,5,0,1,9,0,5,0] – Element of arr[O] to arr[N-1],While input each element is separated by newline

// Output: 4 5 1 9 5 0 0 0

// Example 2:

// Input: 6 — Value of N.

// [6,0,1,8,0,2] – Element of arr[0] to arr[N-1], While input each element is separated by newline

// Output: 6 1 8 2 0 0

#include<bits/stdc++.h>
using namespace std;

vector<int> PushtoEnd(int n, vector<int> &arr){
    int index = 0;
    for(int i=0; i<n; i++){
        if(arr[i] != 0){
            swap(arr[index++],arr[i]);
        }
    }
    
    return arr;
}

int main(){
    int n;
    cin>>n;
    vector<int> arr(n);
    for(int i=0; i<n; i++){
        cin>>arr[i];
    }

    vector<int> res = PushtoEnd(n,arr);
    for(int x : res){
        cout<<x<<" ";
    }
    return 0;
}