You are viewing a single comment's thread. Return to all comments →
class Prime{ void checkPrime(int ... ar1){ for(int i = 0 ; i <= ar1.length-1 ; i++){ boolean isPrime = true; for(int j = 2 ; j <= ar1[i] / 2 ; j++){ if(ar1[i] % j == 0){ isPrime = false; break; } } if(isPrime){ System.out.print(ar1[i]); } } } }
Seems like cookies are disabled on this browser, please enable them to open this website
I agree to HackerRank's Terms of Service and Privacy Policy.
Prime Checker
You are viewing a single comment's thread. Return to all comments →
class Prime{ void checkPrime(int ... ar1){ for(int i = 0 ; i <= ar1.length-1 ; i++){ boolean isPrime = true; for(int j = 2 ; j <= ar1[i] / 2 ; j++){ if(ar1[i] % j == 0){ isPrime = false; break; } } if(isPrime){ System.out.print(ar1[i]); } } } }