Prime Checker – Hacker Rank Solution

Prime Checker - Hacker Rank Solution
Prime Checker – Hacker Rank Solution

Objective

You are given a class Solution and its main method in the editor. Your task is to create a class Prime. The class Prime should contain a single method checkPrime.

The locked code in the editor will call the checkPrime method with one or more integer arguments. You should write the checkPrime method in such a way that the code prints only the prime numbers.

Please read the code given in the editor carefully. Also please do not use method overloading!

Note: You may get a compile time error in this problem due to the statement below:

  BufferedReader br=new BufferedReader(new InputStreamReader(in));

This was added intentionally, and you have to figure out a way to get rid of the error.

Input Format

There are only five lines of input, each containing one integer.

Output Format

There will be only four lines of output. Each line contains only prime numbers depending upon the parameters passed to checkPrime in the main method of the class Solution. In case there is no prime number, then a blank line should be printed.

Sample Input

2
1
3
4
5

Sample Output

2
2
2 3
2 3 5 


Prime Checker – Hacker Rank Solution

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.lang.reflect.*;
import static java.lang.System.in;
class Prime{
	boolean chk(int n){
		if(n<2)return false;
		for(int i=2;i*i<=n;i++)if(n%i==0)return false;
		return true;
	}
	void checkPrime(Integer... a){
		boolean f=false;
		for(int i=0;i<a.length;i++){
			if(chk(a[i])){
				if(f)java.lang.System.out.print(" ");
				f=true;
				java.lang.System.out.print(a[i]);
			}
		}
		java.lang.System.out.println();
	}
}
class Solution{
	public static void main(String[] args){
		try{
		BufferedReader br=new BufferedReader(new InputStreamReader(in));
		int n1=Integer.parseInt(br.readLine());
		int n2=Integer.parseInt(br.readLine());
		int n3=Integer.parseInt(br.readLine());
		int n4=Integer.parseInt(br.readLine());
		int n5=Integer.parseInt(br.readLine());
		Prime ob=new Prime();
		ob.checkPrime(n1);
		ob.checkPrime(n1,n2);
		ob.checkPrime(n1,n2,n3);
		ob.checkPrime(n1,n2,n3,n4,n5);
		Method[] methods=Prime.class.getDeclaredMethods();
		Set<String> set=new HashSet<>();
		boolean overload=false;
		for(int i=0;i<methods.length;i++){
			if(set.contains(methods[i].getName())){
				overload=true;
				break;
			}
			set.add(methods[i].getName());
		}
		if(overload){
			throw new Exception("Overloading not allowed");
		}
		}catch(Exception e){
			System.out.println(e);
		}
	}
}

Disclaimer: The above Problem (Prime Checker ) is generated by Hackerrank but the Solution is Provided by Chase2Learn. This tutorial is only for Educational and Learning purposes. Authority if any of the queries regarding this post or website fill the following contact form thank you.

Leave a Comment