class Solution { public void moveZeroes(int[] nums) { int j=0; for(int i=0; i<nums.length;i++){ if(nums[i] != 0){ int temp = nums[i]; nums[i] = nums[j]; nums[j] = temp; j++; } } } }

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int n = nums.size();
        int k = 0;
        for(int i =0;i<n;i++){
            if(nums[i] != 0){
                nums[k] = nums[i];
                k++;
            }
        }
        for(int i=k;i<n;i++){
            nums[i]=0;
        }
    }
};

public static void pushZeroes(int arr[],int n) {

int k=0;

for(int i=0; i<n; i++) {

if(arr[i]!=0) {

arr[k++]=arr[i];

}

}

while(count<n) {

arr[k++]==0;

}

}

class Solution { public: // Arslan void moveZeroes(vector& nums) { /*int i = 0; int n = nums.size(); for(int j = 0; j arr; int n = nums.size(); int j = 0; for(int i =0; i

{

if(arr[i]!=0)

{

arr1[j] = arr[i];

j++;

}

}

for(int i = j;i<n;i++)

{

arr1[i] = 0;

}

//harsh kumar

int n = arr.length, int j=0;

for(int i=0; i<n; i++){

if(arr[i]!=0){

int temp = arr[i];

arr[i] = arr[j];

arr[j] = temp;

j++;

}

}

if(arr[i] != 0){

arr_new[j]= arr[i];

j++;

}

}

for(int i =j; i<arr.len; i++){

arr_new[i] = 0;

}

//Avi

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int i = 0;
        for(int j = 0; j < nums.size(); j++){
            if(nums[j]  != 0){
                swap(nums[j],nums[i]);
                    i++;
            }
        }
    }
};

class Solution {

public:

// Function to return the count of number of elements in union of two arrays.

int doUnion(vector<int> arr1, vector<int> arr2) {

// code here

int n1 = arr1.size(), n2 = arr2.size();

unordered_set<int> st;

for(int i = 0 ; i < n1 ; i++) st.insert(arr1[i]);

for(int i = 0 ; i < n2 ; i++) st.insert(arr2[i]);

return st.size();

}

};

ques:-

Find the maximum and minimum element in an array

Code:-

public class pp {

public static int[] maxminNumber(int arr[],int size){
                int max = Integer.MIN_VALUE;
        int min = Integer.MAX_VALUE;
          for(int i=0;i<arr.length;i++){ 
            if(arr[i]>max){
                min = max;
                max=arr[i];
            }
            else if(arr[i]<min && arr[i]!=max){
                min=arr[i];
            }
        }
        return new int[] {max,min}
       }
    public static void main(String[] args) {
        int myArray[]={4,5,6,7,1,3};
        for(int i=0;i<myArray.length;i++){
            System.out.print(myArray[i]+" ");
        }
        int [] rp = maxminNumber(myArray, myArray.length);
        System.out.println("Maximum number is"+rp[0]);
        System.out.println("Minimum number is"+rp[1]);
    }
}