Merge branch 'master' of https://github.com/BNSC1/leetcode-kotlin

Author: BNSC1

LeetCode/2849. Determine if a Cell Is Reachable at a Given Time.kt

@@ -0,0 +1,11 @@
+class Solution {
+    fun isReachableAtTime(sx: Int, sy: Int, fx: Int, fy: Int, t: Int): Boolean {
+        if (sx == fx && sy == fy && t == 1) return false
+        val dstX = Math.abs(fx - sx)
+        val dstY = Math.abs(fy - sy)
+        val diag = minOf(dstY, dstX) //diagonal movement
+        val line = maxOf(dstY, dstX) - diag //straight line movement
+        val shortest = diag + line
+        return t >= shortest
+    }
+}

LeetCode/2850. Minimum Moves to Spread Stones Over Grid.kt

@@ -0,0 +1,29 @@
+class Solution {
+    fun minimumMoves(grid: Array<IntArray>): Int {
+        // Base Case
+        var empties = 0
+        repeat(3) { r ->
+            repeat(3) { c ->
+                if (grid[r][c] == 0) empties++
+            }
+        }
+        if (empties == 0) return 0
+        
+        var res = Int.MAX_VALUE
+        repeat(3) { emptyR -> repeat(3) { emptyC ->
+            if (grid[emptyR][emptyC] == 0) {
+                repeat(3) { spareR -> repeat(3) { spareC ->
+                    val distance = abs(spareR - emptyR) + abs(spareC - emptyC)
+                    if (grid[spareR][spareC] > 1) {
+                        grid[spareR][spareC]--
+                        grid[emptyR][emptyC]++
+                        res = min(res, distance + minimumMoves(grid)) //backtrack
+                        grid[spareR][spareC]++
+                        grid[emptyR][emptyC]--
+                    }
+                } }
+            }
+        } }
+        return res
+    }
+}