<p>You are given an <code>m x n</code> binary grid <code>grid</code> where <code>1</code> represents land and <code>0</code> represents water. An <strong>island</strong> is a maximal <strong>4-directionally</strong> (horizontal or vertical) connected group of <code>1</code>&#39;s.</p>

<p>The grid is said to be <strong>connected</strong> if we have <strong>exactly one island</strong>, otherwise is said <strong>disconnected</strong>.</p>

<p>In one day, we are allowed to change <strong>any </strong>single land cell <code>(1)</code> into a water cell <code>(0)</code>.</p>

<p>Return <em>the minimum number of days to disconnect the grid</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/12/24/land1.jpg" style="width: 500px; height: 169px;" />
<pre>
<strong>Input:</strong> grid = [[0,1,1,0],[0,1,1,0],[0,0,0,0]]

<strong>Output:</strong> 2
<strong>Explanation:</strong> We need at least 2 days to get a disconnected grid.
Change land grid[1][1] and grid[0][2] to water and get 2 disconnected island.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/12/24/land2.jpg" style="width: 404px; height: 85px;" />
<pre>
<strong>Input:</strong> grid = [[1,1]]
<strong>Output:</strong> 2
<strong>Explanation:</strong> Grid of full water is also disconnected ([[1,1]] -&gt; [[0,0]]), 0 islands.
</pre>

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

<ul>
	<li><code>m == grid.length</code></li>
	<li><code>n == grid[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 30</code></li>
	<li><code>grid[i][j]</code> is either <code>0</code> or <code>1</code>.</li>
</ul>

def is_square_island(grid):
    number_of_water = 0
    number_of_island_cells = 0
    flag = True
    for i in range(len(grid)):
        for j in range(len(grid[i])):
            if grid[i][j] == 0:
                number_of_water += 1
            if grid[i][j] == 2:
                number_of_island_cells += 1
                is_corner = False
                number_of_neighbours = 0
                if (i+1 < len(grid)) and (grid[i+1][j] == 2):
                    number_of_neighbours += 1
                if (i-1 >= 0) and (grid[i-1][j] == 2):
                    number_of_neighbours += 1
                if (j+1 < len(grid[i])) and (grid[i][j+1] == 2):
                    number_of_neighbours += 1
                if (j-1 >= 0) and (grid[i][j-1] == 2):
                    number_of_neighbours += 1
                if ((j-1 >= 0) and (i-1 >=0)) and (grid[i-1][j-1] == 2):
                    number_of_neighbours += 1
                if ((j-1 >= 0) and (i+1 < len(grid))) and (grid[i+1][j-1] == 2):
                    number_of_neighbours += 1
                if ((j+1 < len(grid[i])) and (i-1 >=0)) and (grid[i-1][j+1] == 2):
                    number_of_neighbours += 1
                if ((j+1 < len(grid[i])) and (i+1 < len(grid))) and (grid[i+1][j+1] == 2):
                    number_of_neighbours += 1
                if number_of_neighbours == 8:
                    is_corner = True
                    continue
                else:
                    grid[i][j] = 0
                    for k in range(len(grid)):
                        for m in range(len(grid[i])):
                            if grid[k][m] == 2:
                                grid[k][m] = 1
                    if not is_disconnect(grid):
                        grid[i][j] = 2
                        is_corner = True
                    else:
                        return False
                    print(i, j, is_corner)
                if not is_corner:
                    return False
    if (not number_of_water) or flag or (number_of_island_cells == 2):
        return True
    else:
        return False
                

def fill_island(grid, i, j):
    grid[i][j] = 2
    if (i-1 >= 0) and (grid[i-1][j] == 1):
        fill_island(grid, i-1, j)
    if (i+1 < len(grid)) and (grid[i+1][j] == 1):
        fill_island(grid, i+1, j)
    if (j-1 >= 0) and (grid[i][j-1] == 1):
        fill_island(grid, i, j-1)
    if (j+1 < len(grid[i])) and (grid[i][j+1] == 1):
        fill_island(grid, i, j+1)

def is_disconnect(grid):
    number_of_islands = 0
    for i in range(len(grid)):
        for j in range(len(grid[i])):
            if grid[i][j] == 1:
                fill_island(grid, i, j)
                number_of_islands += 1
    if number_of_islands == 1:
        return False
    else:
        return True

class Solution:
    def minDays(self, grid: List[List[int]]) -> int:
        if len(grid) == 0:
            return 0
        if len(grid[0]) == 0:
            return 0
        if len(grid) * len(grid[0]) == 1:
            if grid[0][0] == 0:
                return 0
            else:
                return 1
        if is_disconnect(grid):
            return 0
        if is_square_island(grid):
            return 2
        else:
            return 1
        
        
200