Java solution - passes 100% of test cases

From my HackerRank solutions.

import static java.lang.System.in;

class Prime {
    void checkPrime(int... numbers) {
        for (int num : numbers) {
            if (isPrime(num)) {
                System.out.print(num + " ");
            }
        }
        System.out.println();
    }
    
    boolean isPrime(int n) {
        if (n < 2) {
            return false;
        } else if (n == 2) {
            return true;
        } else if (n % 2 == 0) {
            return false;
        }
        int sqrt = (int) Math.sqrt(n);
        for (int i = 3; i <= sqrt; i += 2) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }     
}

Let me know if you have any questions.

Solution.java:25: error: cannot find symbol BufferedReader br=new BufferedReader(new InputStreamReader(in)); ^ symbol: variable in location: class Solution 1 error

MYcode:

import java.io.; import java.util.; import java.text.; import java.math.; import java.util.regex.; import java.lang.reflect.; class Prime{ void checkPrime(int... a) { int flag = 0; for(int i=0;i

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);
    }
}

}

The test case are bad because are printing unnecesary blanks at the end of the lines. I lost many point on this issue.

import static java.lang.System.*;

class Prime {

public void checkPrime(int... p){

    boolean prime;


    for(int i=0;i<p.length;i++){
        prime = true;
        int n = (int)java.lang.Math.sqrt(p[i]);


        if(p[i]>1)
        for(int j=2;j<n+1;j++){

            if(p[i]%j==0){

                prime = false;
                break;
            }

        }
        else prime = false;

        if(prime) {
                out.print(p[i]);
                out.print(" ");
            }
    }

    out.println();


}

}

Mine works

import static java.lang.System.in;

class Prime {
    
    void checkPrime(int... args){
        String outPut = "";
        for (int arg : args){
            if (isPrime(arg)){
                outPut += arg+" "; 
            }
        }
        if (outPut != ""){
            outPut = outPut.substring(0,outPut.length()-1);
            System.out.print(outPut);
        }
        System.out.println();
    }
    
    boolean isPrime(int num){
        if (num < 2){
            return false;
        }
        for (int i = 2; i < (num/2)+1; i++){
            if (num%i==0){
                return false;
            }
        }
        return true;
    }
    
}