From d2d652e3ed137b48bb574bceacaacee06b8ef75f Mon Sep 17 00:00:00 2001
From: Sandeep Kumar Srivastava <56189781+Sandeep228@users.noreply.github.com>
Date: Sun, 4 Oct 2020 12:28:43 +0530
Subject: [PATCH 1/2] Prime Checker

---
 JavaHackerrank/Prime Checker | 74 ++++++++++++++++++++++++++++++++++++
 1 file changed, 74 insertions(+)
 create mode 100644 JavaHackerrank/Prime Checker

diff --git a/JavaHackerrank/Prime Checker b/JavaHackerrank/Prime Checker
new file mode 100644
index 00000000..6f272db6
--- /dev/null
+++ b/JavaHackerrank/Prime Checker	
@@ -0,0 +1,74 @@
+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 {
+    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) {     // account for even numbers now, so that we can do i+=2 in loop below
+            return true;
+        } else if (n % 2 == 0) { // account for even numbers now, so that we can do i+=2 in loop below
+            return false;
+        }
+        int sqrt = (int) Math.sqrt(n);
+        for (int i = 3; i <= sqrt; i += 2) { // skips even numbers for faster results
+            if (n % i == 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+public class Solution {
+
+	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);
+		}
+	}
+	
+}

From 084129095699c5dd31c042e3cf6b355b06de35bc Mon Sep 17 00:00:00 2001
From: Sandeep Kumar Srivastava <56189781+Sandeep228@users.noreply.github.com>
Date: Sun, 4 Oct 2020 12:29:28 +0530
Subject: [PATCH 2/2] Rename Prime Checker to Prime Checker.java

---
 JavaHackerrank/{Prime Checker => Prime Checker.java} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename JavaHackerrank/{Prime Checker => Prime Checker.java} (100%)

diff --git a/JavaHackerrank/Prime Checker b/JavaHackerrank/Prime Checker.java
similarity index 100%
rename from JavaHackerrank/Prime Checker
rename to JavaHackerrank/Prime Checker.java