checkForPrime Q&A aaded

Author: sunilkumarroy450

must-do-questions/checkForPrime.js

@@ -23,4 +23,17 @@ O(1), i.e., constant space complexity.
 Constraints
 1 <= N <= 1000000000*/
 
-
+function Solution(n) {
+  let factor = 0;
+  for (let i = 1; i <= n; i++) {
+    if (n % i === 0) {
+      factor++;
+    }
+  }
+  if (factor === 2) {
+    console.log("Yes");
+  } else {
+    console.log("No");
+  }
+}
+Solution(4);