Hello Friends, How are you? Today I will solve the HackerRank Java Prime Checker Problem with a straightforward explanation. In this article, you will get more than one approach to solve this problem. So let’s start- {tocify} $title={Table of Contents} 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. There are only five lines of input, each containing one integer. 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.
2 1 3 4 5 {codeBox}
2 2 2 3 2 3 5 {codeBox}
Java Prime Checker HackerRank Solution Approach I: Java Prime Checker – Solution HackerRank
// ========================
// Information
// ======================== // Name: Java Prime Checker HackerRank Problem
// Direct Link: https://www.hackerrank.com/challenges/prime-checker/problem
// Difficulty: Medium
// Max Score: 25
// Language: Java 7 // ========================
// Solution Start
// ======================== // Java Prime Checker - Hacker Rank Solution Start import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.lang.reflect.*; // code start here
import static java.lang.System.*; class Prime { public void checkPrime(int... values) { for (int i = 0; i < values.length; i++) { if (PrimeChecker.isPrime(values[i])) { System.out.print(values[i] + " "); } } System.out.print("n"); }
} class PrimeChecker { public static boolean isPrime(int n) { if (n
