add 2583

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/Execute.kt

@@ -1,7 +1,7 @@
 package com.github.contest
 
 
-import com.github.contest.hashTable.findMissingAndRepeatedValuesProdVariant
+import com.github.contest.math.closestPrimes
 import java.util.TreeMap
 
 
@@ -11,12 +11,7 @@ import java.util.TreeMap
 
 fun main() {
 
-    findMissingAndRepeatedValuesProdVariant(
-        arrayOf(
-            intArrayOf(1, 3),
-            intArrayOf(2, 2)
-        )
-    ).also { it.printArray() }
+    closestPrimes(19, 31).also { it.printArray() }
 }
 
 fun generateTesting() {

contest/src/main/java/com/github/contest/math/MathLeetcode.kt

@@ -1,5 +1,7 @@
 package com.github.contest.math
 
+import kotlin.math.sqrt
+
 /**
  * 1025. Divisor Game
  */
@@ -29,4 +31,50 @@ fun checkPowersOfThree(n: Int): Boolean {
 fun coloredCells(n: Int): Long = when {
     n == 1 -> 1L
     else -> coloredCells(n - 1) + 4L * (n - 1).toLong()
-}
+}
+
+/**
+ * 2523. Closest Prime Numbers in Range
+ */
+
+
+fun closestPrimes(left: Int, right: Int): IntArray {
+    val primes = mutableListOf<Int>()
+    val isPrime = BooleanArray(right + 1) { true }
+    isPrime[0] = false
+    isPrime[1] = false
+
+    for (p in 2..sqrt(right.toDouble()).toInt()) {
+        if (isPrime[p]) {
+            for (i in p * p..right step p) {
+                isPrime[i] = false
+            }
+        }
+    }
+
+    for (p in left..right) {
+        if (isPrime[p]) {
+            primes.add(p)
+        }
+    }
+
+    if (primes.size < 2) return intArrayOf(-1, -1)
+
+    var minDiff = Int.MAX_VALUE
+    var result = intArrayOf(-1, -1)
+    for (i in 0 until primes.size - 1) {
+        val diff = primes[i + 1] - primes[i]
+        if (diff < minDiff) {
+            minDiff = diff
+            result[0] = primes[i]
+            result[1] = primes[i + 1]
+        }
+    }
+
+    return result
+}
+
+private fun isPrime(number: Int): Boolean {
+    for (i in number - 1 downTo 2) if (number % i == 0) return false
+    return true
+}