Merge pull request #171

add new problem 7.04

Author: Ashwagandha-coder

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

@@ -1,10 +1,7 @@
 package com.github.contest
 
 
-import com.github.contest.bitManipulation.subsetXORSum
-import com.github.contest.strings.shiftingLetters
-import com.github.contest.strings.smallestStringProdVariant
-
+import com.github.contest.strings.isNumber
 import java.util.TreeMap
 
 
@@ -14,7 +11,7 @@ import java.util.TreeMap
 
 fun main() {
 
-    subsetXORSum(intArrayOf(5, 1, 6))
+    isNumber("6+1").also { println(it) }
 }
 
 fun testing() {

contest/src/main/java/com/github/contest/design/DesignLeetcode.kt

@@ -117,4 +117,39 @@ class Trie() {
         return curr
     }
 
+}
+
+/**
+ * 981. Time Based Key-Value Store
+ */
+
+class TimeMap() {
+
+    private val store = mutableMapOf<String, MutableList<Pair<Int, String>>>()
+
+    fun set(key: String, value: String, timestamp: Int) {
+        store.getOrPut(key) { mutableListOf(Pair(timestamp, value)) }.add(Pair(timestamp, value))
+    }
+
+    fun get(key: String, timestamp: Int): String {
+        val list = store[key] ?: return emptyString()
+        var left = 0
+        var right = list.size - 1
+        var res = emptyString()
+
+        while (left <= right) {
+            val mid = (left + right) / 2
+            val (currentTimeStamp, currentValue) = list[mid]
+            if (currentTimeStamp == timestamp) return currentValue
+            if (currentTimeStamp < timestamp) {
+                left = mid + 1
+                res = currentValue
+            } else right = mid
+        }
+
+        return res
+    }
+
+    private fun emptyString() = ""
+
 }

contest/src/main/java/com/github/contest/dp/DpProdVariant.kt

@@ -148,4 +148,30 @@ fun longestArithSeqLengthProdVariant(nums: IntArray): Int {
             len
         }
     }
+}
+
+/**
+ * 2140. Solving Questions With Brainpower
+ * Prod Variant
+ */
+
+
+fun mostPointsProdVariant(questions: Array<IntArray>): Long {
+    val n = questions.size
+    val dp = LongArray(n + 1)
+    questions.forEachReversedIndexed { index, arr ->
+        val points = arr[0]
+        val brainpower = arr[1]
+        dp[index] = points + when {
+            brainpower + index + 1 < n -> dp[brainpower + index + 1]
+            else -> 0L
+        }
+        dp[index] = maxOf(dp[index], dp[index + 1])
+    }
+
+    return dp.first()
+}
+
+fun <T> Array<T>.forEachReversedIndexed(action: (Int, T) -> Unit) {
+    for (i in this.size - 1 downTo 0) action(i, this[i])
 }

contest/src/main/java/com/github/contest/twoPointer/TwoPointerLeetCode.kt

@@ -0,0 +1,22 @@
+package com.github.contest.twoPointer
+
+/**
+ * 165. Compare Version Numbers
+ */
+
+fun compareVersion(version1: String, version2: String): Int {
+    val firstNumber = version1.split(".").map { it.toInt() }
+    val secondNumber = version2.split(".").map { it.toInt() }
+
+    for (i in 0 until maxOf(firstNumber.size, secondNumber.size)) {
+        val p1 = if (i < firstNumber.size) firstNumber[i] else 0
+        val p2 = if (i < secondNumber.size) secondNumber[i] else 0
+
+        when {
+            p1 != p2 -> {
+                return if (p1 > p2) 1 else -1
+            }
+        }
+    }
+    return 0
+}