From edf3f5ea3177db77500d93a5a5463b2ff8d6afbf Mon Sep 17 00:00:00 2001
From: aadil42 <77232799+aadil42@users.noreply.github.com>
Date: Fri, 7 Mar 2025 17:54:28 +0530
Subject: [PATCH] Create 2523-closest-prime-numbers-in-range.js

Add Solution for closest-prime-numbers-in-range
---
 .../2523-closest-prime-numbers-in-range.js    | 51 +++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 javascript/2523-closest-prime-numbers-in-range.js

diff --git a/javascript/2523-closest-prime-numbers-in-range.js b/javascript/2523-closest-prime-numbers-in-range.js
new file mode 100644
index 000000000..d9b5da69e
--- /dev/null
+++ b/javascript/2523-closest-prime-numbers-in-range.js
@@ -0,0 +1,51 @@
+/**
+ * Sieve Algorithm
+ * Time O(n*log(log(n))) |  Space O(n)
+ * https://leetcode.com/problems/closest-prime-numbers-in-range
+ * @param {number} left
+ * @param {number} right
+ * @return {number[]}
+ */
+var closestPrimes = function(left, right) {
+
+    const isNotPrime = {
+        1: true // 1 is not prime number. 
+    };
+
+    for (let i = 2; i < right+1; i++) {
+        if (!isNotPrime[i]) {
+            let factor = 2;
+            while (i*factor <= right) {
+                isNotPrime[i*factor] = true;
+                factor++;
+            }
+        }
+    }
+
+    const primesInOrder = [];
+
+    while (left < right+1) {
+        if (!isNotPrime[left]) {
+            primesInOrder.push(left);
+        }
+        left++;
+    }    
+
+    let minDistance = Infinity;
+    const ans = [];
+
+    for (let i = 1; i < primesInOrder.length; i++) {
+        
+        const prime1 = primesInOrder[i];
+        const prime0 = primesInOrder[i-1];
+
+        if (prime1 - prime0 < minDistance) {
+            minDistance = prime1-prime0;
+            ans[0] = prime0;
+            ans[1] = prime1;
+        }
+    }
+
+    if (!ans.length) return [-1, -1];
+    return ans;
+};