We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Advanced
  4. Prime Checker
  5. Discussions

Prime Checker

Sort by

recency

|

353 Discussions

|

  • mrshaikhmuhammed
     + 0 comments
    class Prime{
    public void checkPrime(int... input){
        boolean isPrime;
        for(int i: input){
            isPrime = true;
            for(int j=2; j*j<=i; j++){
                if(i%j == 0){
                    isPrime=false;
                    break;
                }
            }
            if(isPrime && i!=1){
                System.out.print(i + " ");
            }
        }
        System.out.println();
    }
}

  • yashdeora98294
     + 0 comments

    Here is Prime checker in java solution - https://programmingoneonone.com/hackerrank-prime-checker-problem-solution-in-java.html

  • peter_szaszvari
     + 1 comment

    The problem description does not fit the code. For me the solution class is empty, there is no locked code.

  • harisainadh1234
     + 0 comments

    import java.util.*;

    class Prime { void checkPrime(int... numbers) { for (int i = 0; i < numbers.length; i++) { int num = numbers[i]; int count = 0;

            if (num < 2) {
            continue;
        }

        for (int j = 1; j <= num; j++) {
            if (num % j == 0) {
                count++;
            }
        }

        if (count == 2) {
            System.out.print(num + " ");
        }
    }
    System.out.println();
}

    }

    public class Solution { public static void main(String[] args) { Scanner scanner = new Scanner(System.in);

        int n1 = scanner.nextInt();
    int n2 = scanner.nextInt();
    int n3 = scanner.nextInt();
    int n4 = scanner.nextInt();
    int n5 = scanner.nextInt();

    Prime prime = new Prime();

    prime.checkPrime(n1);
    prime.checkPrime(n1, n2);
    prime.checkPrime(n1, n2, n3);
    prime.checkPrime(n1, n2, n3, n4, n5);

    scanner.close();
}

    }

  • thythalasagar551
     + 0 comments

    import java.io.; import java.util.; import java.text.; import java.math.; import java.util.regex.; import java.lang.reflect.;

    class Prime { public void checkPrime(int... numbers) { for (int num : numbers) { if (isPrime(num)) { System.out.print(num + " "); } } System.out.println(); }

    private boolean isPrime(int n) {
    if (n <= 1) return false;
    if (n == 2) return true;
    if (n % 2 == 0) return false;
    for (int i = 3; i * i <= n; i += 2) {
        if (n % i == 0) return false;
    }
    return true;
}

    }

    public class Solution { public static void main(String[] args) { try { BufferedReader br = new BufferedReader(new InputStreamReader(System.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 (Method method : methods) {
            if (set.contains(method.getName())) {
                overload = true;
                break;
            }
            set.add(method.getName());
        }
        if (overload) {
            throw new Exception("Overloading not allowed");
        }
    } catch (Exception e) {
        System.out.println(e);
    }
}

    }