Prime Checker Hackerrank Solution For Explanation Click Here: Sample Input 2 1 3 4 5 Sample Output 2 2 2 3 2 3 5 Code: 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{ public void checkPrime( int ... arr){ //2 1 3 4 5 for ( int i= 0 ;i<arr.length;i++){ if (arr[i]< 2 ){ } else if (arr[i]== 2 ){ System.out.print(arr[i]+ " " ); //2 } else { int logic = 1 ; for ( int j= 2 ;j<arr[i];j++){ if (arr[i]%j== 0 ){ logic = 0 ; break ; } } if (logic== 1 ){ System.out.print(arr[i]+ " " ); //3 5 } } } System