Merge pull request neetcode-gh#1329 from t3chkid/main

Ahmad-A0 · web-flow · commit 06ec2a0bb524 · 2022-11-02T22:30:17.000Z
Adds solution for 981. Time Based Key-Value Store in Kotlin
diff --git a/README.md b/README.md
@@ -148,10 +148,10 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[367 - Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F367-Valid-Perfect-Square.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F367-Valid-Perfect-Square.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[74 - Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)</sub> | <sub><div align='center'>[✔️](c%2F74-Search-A-2D-Matrix.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F74-Search-A-2d-Matrix.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F74-Search-A-2D-Matrix.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F74-Search-A-2D-Matrix.go)</div></sub> | <sub><div align='center'>[✔️](java%2F74-Search-A-2D-Matrix.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F74-Search-A-2D-Matrix.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F74-Search-A-2D-Matrix.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F74-Search-a-2D-Matrix.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F74-Search-a-2D-Matrix.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F746-Min-Cost-Climbing-Stairs.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F74-Search-A-2D-Matrix.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F74-Search-a-2D-Matrix.ts)</div></sub>
 <sub>[875 - Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/)</sub> | <sub><div align='center'>[✔️](c%2F875-Koko-Eating-Bananas.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F875-Koko-Eating-Bananas.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F875-Koko-Eating-Bananas.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F875-Koko-Eating-Bananas.go)</div></sub> | <sub><div align='center'>[✔️](java%2F875-Koko-Eating-Bananas.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F875-Koko-Eating-Bananas.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F875-Koko-Eating-Bananas.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F875-Koko-Eating-Bananas.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F875-Koko-Eating-Bananas.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F875-Koko-Eating-Bananas.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F875-Koko-Eating-Bananas.ts)</div></sub>
-<sub>[33 - Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)</sub> | <sub><div align='center'>[✔️](c%2F33-Search-in-Rotated-Sorted-Array.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F33-Search-In-Rotated-Sorted-Array.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F33-Search-In-Rotated-Sorted-Array.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F33-Search-in-Rotated-Sorted-Array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F33-Search-In-Rotated-Sorted-Array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F33-Search-in-Rotated-Sorted-Array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F33-Search-In-Rotated-Sorted-Array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F33-Search-In-Rotated-Sorted-Array.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F338-Counting-Bits.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F33-Search-In-Rotated-Sorted-Array.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F33-Search-in-Rotated-Sorted-Array.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F33-Search-in-Rotated-Sorted-Array.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F33-Search-in-Rotated-Sorted-Array.ts)</div></sub>
-<sub>[153 - Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)</sub> | <sub><div align='center'>[✔️](c%2F153-Find-Minimum-in-Rotated-Sorted-Array.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F153-Find-Minimum-In-Rotated-Sorted-Array.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F153-Find-Minimum-in-Rotated-Sorted-Array.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F153-Find-Minimum-in-Rotated-Sorted-Array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F153-Find-Minimum-in-Rotated-Sorted-Array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F153-Find-Minimum-in-Rotated-Sorted-Array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F153-Find-Minimum-In-Rotated-Sorted-Array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F153-Find-Minimum-in-Rotated-Sorted-Array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F153-Find-Minimum-In-Rotated-Sorted-Array.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F153-Find-Minimum-In-Rotated-Sorted-Array.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F153-Find-Minimum-in-Rotated-Sorted-Array.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F153-Find-Minimum-in-Rotated-Sorted-Array.ts)</div></sub>
-<sub>[981 - Time Based Key Value Store](https://leetcode.com/problems/time-based-key-value-store/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F981-Time-Based-Key-Value-Store.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F981-Time-Based-Key-Value-Store.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F981-Time-Based-Key-Value-Store.go)</div></sub> | <sub><div align='center'>[✔️](java%2F981-Time-Based-Key-Value-Store.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F981-Time-Based-Key-Value-Store.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F981-Time-Based-Key-Value-Store.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F981-Time-Based-Key-Value-Store.ts)</div></sub>
-<sub>[34 - Find First And Last Position of Element In Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F342-Power-Of-Four.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F347-Top-K-Frequent-Elements.go)</div></sub> | <sub><div align='center'>[✔️](java%2F342-Power-of-Four.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F344-Reverse-String.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F347-Top-K-Frequent-Elements.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F347-Top-k-frequent-elements.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F347-Top-K-Frequent-Elements.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F347-Top-k-frequent-elements.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F344-Reverse-String.ts)</div></sub>
+<sub>[33 - Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)</sub> | <sub><div align='center'>[✔️](c%2F33-Search-in-Rotated-Sorted-Array.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F33-Search-In-Rotated-Sorted-Array.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F33-Search-In-Rotated-Sorted-Array.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F33-Search-in-Rotated-Sorted-Array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F33-Search-In-Rotated-Sorted-Array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F33-Search-in-Rotated-Sorted-Array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F33-Search-In-Rotated-Sorted-Array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F33-Search-In-Rotated-Sorted-Array.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F338-Counting-Bits.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](scala%2F33-Search-in-Rotated-Sorted-Array.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F33-Search-in-Rotated-Sorted-Array.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F33-Search-in-Rotated-Sorted-Array.ts)</div></sub>
+<sub>[153 - Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)</sub> | <sub><div align='center'>[✔️](c%2F153-Find-Minimum-in-Rotated-Sorted-Array.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F153-Find-Minimum-In-Rotated-Sorted-Array.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F153-Find-Minimum-in-Rotated-Sorted-Array.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F153-Find-Minimum-in-Rotated-Sorted-Array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F153-Find-Minimum-in-Rotated-Sorted-Array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F153-Find-Minimum-in-Rotated-Sorted-Array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F153-Find-Minimum-In-Rotated-Sorted-Array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F153-Find-Minimum-in-Rotated-Sorted-Array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](scala%2F153-Find-Minimum-In-Rotated-Sorted-Array.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F153-Find-Minimum-in-Rotated-Sorted-Array.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F153-Find-Minimum-in-Rotated-Sorted-Array.ts)</div></sub>
+<sub>[981 - Time Based Key Value Store](https://leetcode.com/problems/time-based-key-value-store/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F981-Time-Based-Key-Value-Store.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F981-Time-Based-Key-Value-Store.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F981-Time-Based-Key-Value-Store.go)</div></sub> | <sub><div align='center'>[✔️](java%2F981-Time-Based-Key-Value-Store.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F981-Time-Based-Key-Value-Store.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F981-Time-Based-Key-Value-Store.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F981-Time-Based-Key-Value-Store.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F981-Time-Based-Key-Value-Store.ts)</div></sub>
+<sub>[34 - Find First And Last Position of Element In Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F342-Power-Of-Four.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F347-Top-K-Frequent-Elements.go)</div></sub> | <sub><div align='center'>[✔️](java%2F342-Power-of-Four.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F347-Top-K-Frequent-Elements.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F347-Top-K-Frequent-Elements.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F347-Top-k-frequent-elements.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F347-Top-K-Frequent-Elements.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F347-Top-k-frequent-elements.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F347-Top-K-Frequent-Elements.ts)</div></sub>
 <sub>[1898 - Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[116 - Populating Next Right Pointers In Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1160-Find-Words-That-Can-Be-Formed-by-Characters.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[1268 - Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
diff --git a/kotlin/981-Time-Based-Key-Value-Store.kt b/kotlin/981-Time-Based-Key-Value-Store.kt
@@ -0,0 +1,47 @@
+class TimeMap {
+    private data class TimeStampValuePair(
+        val timestamp: Int,
+        val value: String
+    )
+
+    private val keyMap = mutableMapOf<String, MutableList<TimeStampValuePair>>()
+
+    fun set(key: String, value: String, timestamp: Int) {
+        keyMap.getOrPut(key, ::mutableListOf).add(TimeStampValuePair(timestamp, value))
+    }
+
+    fun get(key: String, timestamp: Int): String {
+        if (key !in keyMap.keys) return ""
+        val searchList = keyMap.getValue(key)
+        if (searchList.isEmpty()) return ""
+        return binarySearch(
+            list = searchList,
+            targetTimeStamp = timestamp
+        )
+    }
+
+    private fun binarySearch(
+        list: List<TimeStampValuePair>,
+        targetTimeStamp: Int
+    ): String {
+        if (list.first().timestamp > targetTimeStamp) return ""
+        if (list.last().timestamp < targetTimeStamp) return list.last().value
+        var startIndex = 0
+        var endIndex = list.lastIndex
+        var midIndex: Int
+        var result = ""
+        while (startIndex <= endIndex) {
+            midIndex = startIndex + (endIndex - startIndex) / 2
+            when {
+                list[midIndex].timestamp <= targetTimeStamp -> {
+                    if (list[midIndex].timestamp == targetTimeStamp) return list[midIndex].value
+                    result = list[midIndex].value
+                    startIndex = midIndex + 1
+                }
+
+                else -> endIndex = midIndex - 1
+            }
+        }
+        return result
+    }
+}
