Merge pull request #164

add new problem 7.03

Author: Ashwagandha-coder

.idea/other.xml

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

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

@@ -226,5 +226,34 @@ private fun sumOfDigit(num: Int): Int {
         num /= 10
     }
 
+    return res
+}
+
+/**
+ * 2965. Find Missing and Repeated Values
+ */
+
+fun findMissingAndRepeatedValues(grid: Array<IntArray>): IntArray {
+    val map = mutableMapOf<Int, Int>()
+    val res = IntArray(2)
+    val n = grid.size
+    for (arr in grid) {
+        for (num in arr) {
+            map[num] = map.getOrDefault(num, 0) + 1
+        }
+    }
+    for (key in map.keys) {
+        if (map[key] == 2) {
+            res[0] = key
+            break
+        }
+    }
+    for (i in 1..(n * n)) {
+        if (!map.contains(i)) {
+            res[1] = i
+            break
+        }
+    }
+
     return res
 }

contest/src/main/java/com/github/contest/hashTable/HashTableLeetcode.kt

@@ -17,3 +17,34 @@ fun areAlmostEqualProdVariant(s1: String, s2: String): Boolean =
             }
     }
 
+/**
+ * 2965. Find Missing and Repeated Values
+ * Prod Variant
+ */
+
+fun findMissingAndRepeatedValuesProdVariant(grid: Array<IntArray>): IntArray {
+    val map = mutableMapOf<Int, Int>()
+    val res = IntArray(2)
+    val n = grid.size
+
+    grid.forEach { row ->
+        row.forEach {
+            map[it] = map.getOrDefault(it, 0) + 1
+        }
+    }
+
+    map.forEach { (num, count) ->
+        if (count == 2) {
+            res[0] = num
+            return@forEach
+        }
+    }
+
+    (1..(n * n)).forEach {
+        if (!map.contains(it)) res[1] = it
+    }
+
+    return res
+}
+
+

contest/src/main/java/com/github/contest/hashTable/HashTableProdVariant.kt

@@ -1,5 +1,7 @@
 package com.github.contest.math
 
+import kotlin.math.sqrt
+
 /**
  * 1025. Divisor Game
  */
@@ -19,4 +21,56 @@ fun checkPowersOfThree(n: Int): Boolean {
         num /= 3
     }
     return true
-}
+}
+
+/**
+ * 2579. Count Total Number of Colored Cells
+ */
+
+
+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
+}
+