<p>You are given a <strong>0-indexed</strong> <code>m x n</code> binary matrix <code>land</code> where a <code>0</code> represents a hectare of forested land and a <code>1</code> represents a hectare of farmland.</p>

<p>To keep the land organized, there are designated rectangular areas of hectares that consist <strong>entirely</strong> of farmland. These rectangular areas are called <strong>groups</strong>. No two groups are adjacent, meaning farmland in one group is <strong>not</strong> four-directionally adjacent to another farmland in a different group.</p>

<p><code>land</code> can be represented by a coordinate system where the top left corner of <code>land</code> is <code>(0, 0)</code> and the bottom right corner of <code>land</code> is <code>(m-1, n-1)</code>. Find the coordinates of the top left and bottom right corner of each <strong>group</strong> of farmland. A <strong>group</strong> of farmland with a top left corner at <code>(r<sub>1</sub>, c<sub>1</sub>)</code> and a bottom right corner at <code>(r<sub>2</sub>, c<sub>2</sub>)</code> is represented by the 4-length array <code>[r<sub>1</sub>, c<sub>1</sub>, r<sub>2</sub>, c<sub>2</sub>].</code></p>

<p>Return <em>a 2D array containing the 4-length arrays described above for each <strong>group</strong> of farmland in </em><code>land</code><em>. If there are no groups of farmland, return an empty array. You may return the answer in <strong>any order</strong></em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/07/27/screenshot-2021-07-27-at-12-23-15-copy-of-diagram-drawio-diagrams-net.png" style="width: 300px; height: 300px;" />
<pre>
<strong>Input:</strong> land = [[1,0,0],[0,1,1],[0,1,1]]
<strong>Output:</strong> [[0,0,0,0],[1,1,2,2]]
<strong>Explanation:</strong>
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].
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/07/27/screenshot-2021-07-27-at-12-30-26-copy-of-diagram-drawio-diagrams-net.png" style="width: 200px; height: 200px;" />
<pre>
<strong>Input:</strong> land = [[1,1],[1,1]]
<strong>Output:</strong> [[0,0,1,1]]
<strong>Explanation:</strong>
The first group has a top left corner at land[0][0] and a bottom right corner at land[1][1].
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/07/27/screenshot-2021-07-27-at-12-32-24-copy-of-diagram-drawio-diagrams-net.png" style="width: 100px; height: 100px;" />
<pre>
<strong>Input:</strong> land = [[0]]
<strong>Output:</strong> []
<strong>Explanation:</strong>
There are no groups of farmland.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>m == land.length</code></li>
	<li><code>n == land[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 300</code></li>
	<li><code>land</code> consists of only <code>0</code>&#39;s and <code>1</code>&#39;s.</li>
	<li>Groups of farmland are <strong>rectangular</strong> in shape.</li>
</ul>

class Solution:
    def check_neightbor(self, land, checked, i, j, neighs = []):
        # print("\n=> Init ", i, j, neighs)
        rows, cols = len(land), len(land[0])
        if (i < 0 and i > rows) or (j < 0 or j > cols):
            return neighs

        if not checked[i][j]:
            checked[i][j] = True
            # print("-> ",neighs)
            neighs += [[i, j]]
            # print("-> ",neighs)
        else:
            # print(f"Return {i} {j}")
            return neighs

        
        # print(f"Calling {i+1} | {j} {(0 <= i+1 < rows)} {(0 <= j < cols)}")
        if (0 <= i+1 < rows) and (0 <= j < cols) and (not checked[i+1][j]):
            # print(f"Called {i+1} | {j}")
            neighs = self.check_neightbor(land, checked, i+1, j, neighs)
        # print(f"Calling {i-1} | {j} {(0 <= i-1 < rows)} {(0 <= j < cols)}")
        if (0 <= i-1 < rows) and (0 <= j < cols) and (not checked[i-1][j]):
            # print(f"Called {i-1} | {j}")
            neighs = self.check_neightbor(land, checked, i-1, j, neighs)
        # print(f"Calling {i} | {j+1} {(0 <= i < rows)} {(0 <= j+1 < cols)}")
        if (0 <= i < rows) and (0 <= j+1 < cols) and (not checked[i][j+1]):
            # print(f"Called {i} | {j+1}")
            neighs = self.check_neightbor(land, checked, i, j+1, neighs)
        # print(f"Calling {i} | {j-1}  {(0 <= i < rows)} {(0 <= j-1 < cols)}")
        if (0 <= i < rows) and (0 <= j-1 < cols) and (not checked[i][j-1]):
            # print(f"Called {i} | {j-1}")
            neighs = self.check_neightbor(land, checked, i, j-1, neighs)

        return neighs


    def findFarmland(self, land: List[List[int]]) -> List[List[int]]:
        # [print(i) for i in land]
        checked = [[True if j == 0 else False for j in i] for i in land]
        # [print(i) for i in checked]

        rows, cols = len(land), len(land[0])
        conteo = 0
        groups = []
        corners = []
        for i in range(rows):
            for j in range(cols):
                if not checked[i][j]:
                    groups.append(self.check_neightbor(land, checked, i, j, []))
                    # print(">>", len(groups), groups[-1], checked)
                    # print("Out of check")
        
        # print("\n\n")
        for i in groups:
            print(i)
            # print(i, min(i), max(i))
            corners.append([*min(i), *max(i)])

        return corners
        
976