isPrime added using js

Author: MehraDevesh2022

01-GettingStarted/03-IsPrimeNumber/Main.class

@@ -39,28 +39,33 @@
 
 import java.util.*;
 
-public class Main{
-    public static void main(String[] args) {
-    Scanner scn = new Scanner(System.in);
-    int low = scn.nextInt();
-    int high = scn.nextInt();
-     primeTillN(low ,high);
-    }
+public class Main {
+
+    public static void main(String[] args){
+        Scanner scn = new Scanner(System.in);
+        int t  = scn.nextInt() ;
 
-    public static void primeTillN(int low , int high){
-        for(int num = low; num<=high; num++){
-        boolean ans  = isPrime(num);
-          if(ans == true){
-               System.out.println(num);
-          }
-        }
+
+       for(int  i=0; i<t; i++){
+        int n = scn.nextInt();
+        boolean IsPrimeNumber = isPrime(n);
+        if(IsPrimeNumber){
+            System.out.println("prime");
+       }else{
+              System.out.println("not prime");
+         }
+       }
+         
     }
-    public static boolean isPrime(int num){
-        for(int i=2; i*i<num; i++){
-            if(num %2 ==0){
-                return false;
-            }
+
+
+  public static boolean isPrime(int number){
+      for(int i=2; i*i<=number; i++){
+        if(number%i ==0){
+            return false;
         }
-        return true;
-    }
+      }
+      return true;
+  }
+         
 }

01-GettingStarted/IsPrimeNumber/Main.java renamed to 01-GettingStarted/03-IsPrimeNumber/Main.java

@@ -0,0 +1,56 @@
+const readline = require("readline");
+
+const rl = readline.createInterface({
+  input: process.stdin,
+  output: process.stdout,
+});
+
+function main() {
+  rl.question("", function (input) {
+    const t = parseInt(input);
+    if (isNaN(t)) {
+      console.log("Please enter a  valid number");
+      rl.close();
+    }
+
+    processTestCase(t, 0);
+  });
+}
+
+function processTestCase(totalTest, currTestCase) {
+  if(totalTest ===currTestCase){
+    rl.close();
+    return;
+  }
+
+  rl.question("", function (number) {
+    let n = parseInt(number);
+    if(isNaN(n)){
+        console.log("Please enter a  valid number");
+        rl.close(); 
+    }
+   
+ else {
+    let isPrime  = isPrimeNumber(n);
+    if(isPrime){
+        console.log("Number is Prime");
+    }else {
+        console.log("number is not prime");
+    }
+ }   
+
+ processTestCase(totalTest , currTestCase +1);
+
+  });
+}
+
+function isPrimeNumber(num) {
+  for (let i = 2; i * i <= num; i++) {
+    if (num % i == 0) {
+      return false;
+    }
+  }
+  return true;
+}
+
+main();