Leetcode | Find All Groups of Farmland | Kotlin

devstromo · devstromo · commit 00abb91cb4de · 2025-04-18T23:08:17.000-03:00
diff --git a/leetcode/src/main/kotlin/com/devstromo/medium/p1992/DESCRIPTION.md b/leetcode/src/main/kotlin/com/devstromo/medium/p1992/DESCRIPTION.md
@@ -0,0 +1,39 @@
+# 1992. Find All Groups of Farmland
+
+You are given a 0-indexed `m x n` binary matrix `land` where a `0` represents a hectare of forested land and a 1 represents a hectare of farmland.
+
+To keep the land organized, there are designated rectangular areas of hectares that consist entirely of farmland. These rectangular areas are called groups. No two groups are adjacent, meaning farmland in one group is not four-directionally adjacent to another farmland in a different group.
+
+`land` can be represented by a coordinate system where the top left corner of `land` is `(0, 0)` and the bottom right corner of `land` is `(m-1, n-1)`. Find the coordinates of the top left and bottom right corner of each group of farmland. A group of farmland with a top left corner at `(r1, c1)` and a bottom right corner at `(r2, c2)` is represented by the 4-length array `[r1, c1, r2, c2]`.
+
+Return a 2D array containing the 4-length arrays described above for each group of farmland in `land`. If there are no groups of farmland, return an empty array. You may return the answer in any order.
+
+Example 1:
+
+Input: land = [[1,0,0],[0,1,1],[0,1,1]]
+Output: [[0,0,0,0],[1,1,2,2]]
+Explanation:
+The first group has a top left corner at land[0][0] and a bottom right corner at land[0][0].
+The second group has a top left corner at land[1][1] and a bottom right corner at land[2][2].
+
+Example 2:
+
+Input: land = [[1,1],[1,1]]
+Output: [[0,0,1,1]]
+Explanation:
+The first group has a top left corner at land[0][0] and a bottom right corner at land[1][1].
+
+Example 3:
+
+Input: land = [[0]]
+Output: []
+Explanation:
+There are no groups of farmland.
+
+Constraints:
+
+- `m == land.length`
+- `n == land[i].length`
+- `1 <= m, n <= 300`
+- `land` consists of only `0`'s and `1`'s.
+- Groups of farmland are **rectangular** in shape.
diff --git a/leetcode/src/main/kotlin/com/devstromo/medium/p1992/SolutionKt.kt b/leetcode/src/main/kotlin/com/devstromo/medium/p1992/SolutionKt.kt
@@ -0,0 +1,40 @@
+package com.devstromo.medium.p1992
+
+import kotlin.collections.toTypedArray
+
+class SolutionKt {
+    fun findFarmland(land: Array<IntArray>): Array<IntArray> {
+        val m = land.size
+        val n = land[0].size
+        val result = mutableListOf<IntArray>()
+
+        for (r in 0 until m) {
+            for (c in 0 until n) {
+                if (land[r][c] == 1) {
+                    val bounds = intArrayOf(r, c, r, c)
+                    dfs(land, r, c, bounds)
+                    result.add(bounds)
+                }
+            }
+        }
+
+        return result.toTypedArray()
+    }
+
+    private fun dfs(land: Array<IntArray>, r: Int, c: Int, bounds: IntArray) {
+        val m = land.size
+        val n = land[0].size
+
+        if (r !in 0 until m || c !in 0 until n || land[r][c] != 1) return
+
+        land[r][c] = -1 // Mark as visited
+
+        bounds[2] = maxOf(bounds[2], r)
+        bounds[3] = maxOf(bounds[3], c)
+
+        dfs(land, r + 1, c, bounds)
+        dfs(land, r - 1, c, bounds)
+        dfs(land, r, c + 1, bounds)
+        dfs(land, r, c - 1, bounds)
+    }
+}
diff --git a/leetcode/src/test/kotlin/com/devstromo/medium/p1992/SolutionKtUnitTest.kt b/leetcode/src/test/kotlin/com/devstromo/medium/p1992/SolutionKtUnitTest.kt
@@ -0,0 +1,43 @@
+package com.devstromo.medium.p1992
+
+import org.junit.jupiter.api.Assertions.assertArrayEquals
+import org.junit.jupiter.api.Test
+
+class SolutionKtUnitTest {
+    private val solution = SolutionKt()
+
+    @Test
+    fun `Test Find All Groups of Farmland`() {
+        assertArrayEquals(
+            arrayOf<IntArray?>(
+                intArrayOf(0, 0, 0, 0),
+                intArrayOf(1, 1, 2, 2),
+            ),
+            solution.findFarmland(
+                arrayOf(
+                    intArrayOf(1, 0, 0),
+                    intArrayOf(0, 1, 1),
+                    intArrayOf(0, 1, 1)
+                )
+            )
+        )
+        assertArrayEquals(
+            arrayOf<IntArray?>(
+                intArrayOf(0, 0, 1, 1)
+            ),
+            solution.findFarmland(
+                arrayOf(
+                    intArrayOf(1, 1),
+                    intArrayOf(1, 1)
+                )
+            )
+        )
+        assertArrayEquals(
+            arrayOf<IntArray?>(
+                intArrayOf(0)
+            ),
+            solution.findFarmland(arrayOf())
+        )
+    }
+
+}
