Array Formation HackerEarth

 

import java.util.*;
import java.util.LinkedList;
import java.util.Queue;
 
class PrimeChecker{
	Queue<Integer> q;
	
	Stack<Integer> stack;
	Stack<Integer> stack1;
	
	public PrimeChecker(){
		q=new LinkedList<Integer>();
		stack=new Stack<Integer>();
	}
	public void isPrime(int num){
		boolean b=true;
		for(int i=2;i<=num/2;i++)
		{
           int temp=num%i;
			if(temp==0)
			{
				b=false;
				break;
			}
		}
		
		if(b){
			//System.out.println(num + " is a Prime Number");
			
			q.add(num);
		}
		else{
			//System.out.println(num + " is not a Prime Number");
			stack.push(num);
		}
	}
        
		
		
        // This is checked so that we can skip
        // middle five numbers in below loop
        
	
	public void toPrint(){
		//System.out.println(/*"Queue is: "+*/ q);
		//System.out.println(/*"Intermediate Stack is: "+*/stack);
		stack1=new Stack<Integer>();
		while(!stack.isEmpty()){
			stack1.push(stack.pop());
		}
		//System.out.print(" Final Stack is: "+stack1);*/
		int arr1[]=new int[q.size()];
		int index=0;
		while(!q.isEmpty()){
			arr1[index++]=q.remove();
		}
 
		Object[] arr = stack1.toArray();
  
        //System.out.println("The array is:");
       
 
		for(int i=0;i<index;i++){
			System.out.print(arr1[i]+" ");
		}
		System.out.println();
 
		 for (int j = 0; j < arr.length; j++){
            System.out.print(arr[j]+" ");
		}
		
		
		
		
	}
}
	
 
class HackerEarth3{
	
	public static void main(String arg[]){
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int arr[]=new int[n];
		for(int i=0;i<n;i++){
			arr[i]=sc.nextInt();
		}
		/*for(int i=0;i<n;i++){
			System.out.print(arr[i]+" ");
		}*/
		
		PrimeChecker obj=new PrimeChecker();
		for(int i=0;i<n;i++){
			obj.isPrime(arr[i]);
		}
		obj.toPrint();
		
	}
 
 
}

Language: Java

Approach:

We will check all the elements of entered array whether they are prime or not.

If they are prime push in a queue or else in the stack.

Take one more stack (stack 1)so as you will get the reverse of elements present in the stack.

Then add all the elements using remove operation in queue and pop operation in the stack into two different arrays.

Later print the arrays.

Thanks for Reading.😇