<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>

class Solution:
    def minDays(self, grid: List[List[int]]) -> int:
        def isway(no,start,fin):
            d=deque()
            visited=set()
            visited.add(no)
            visited.add(start)
            d.append(start)
            while d:
                x, y = d.popleft()
                if x > 0 and grid[x - 1][y] == 2 and (x-1,y) not in visited:
                    visited.add((x-1,y))
                    d.append((x - 1, y))
                    if (x-1,y) in fin:
                        return True
                if y > 0 and grid[x][y - 1] == 2 and (x,y-1) not in visited:
                    visited.add((x, y-1))
                    d.append((x, y-1))
                    if (x, y-1) in fin:
                        return True
                if x < n - 1 and grid[x + 1][y] == 2 and (x+1,y) not in visited:
                    visited.add((x + 1, y))
                    d.append((x + 1, y))
                    if (x + 1, y) in fin:
                        return True
                if y < m - 1 and grid[x][y + 1] == 2 and (x,y+1) not in visited:
                    visited.add((x, y + 1))
                    d.append((x, y+1 ))
                    if (x, y+1) in fin:
                        return True
            return False
        n,m=len(grid),len(grid[0])
        isl=1
        count=0
        for i in range(n):
            for j in range(m):
                if grid[i][j]==1:
                    isl+=1
                    if isl==3:
                        return 0
                    count=1
                    grid[i][j]=isl
                    d=deque()
                    d.append((i,j))
                    while d:
                        x,y=d.popleft()
                        if x>0 and grid[x-1][y]==1:
                            count+=1
                            grid[x-1][y]=isl
                            d.append((x-1,y))
                        if y>0 and grid[x][y-1]==1:
                            count+=1
                            grid[x][y-1]=isl
                            d.append((x,y-1))
                        if x<n-1 and grid[x+1][y]==1:
                            count+=1
                            grid[x+1][y]=isl
                            d.append((x+1,y))
                        if y<m-1 and grid[x][y+1]==1:
                            count+=1
                            grid[x][y+1]=isl
                            d.append((x,y+1))
        if count<3:
            return count
        if count==n*m:
            return 2
        e=dict()
        for i in range(n):
            for j in range(m):
                if grid[i][j]==2:
                    edge=set()
                    if i>0 and grid[i-1][j]==2:
                        edge.add((i-1,j))
                    if j>0 and grid[i][j-1]==2:
                        edge.add((i,j-1))
                    if i<n-1 and grid[i+1][j]==2:
                        edge.add((i+1,j))
                    if j<m-1 and grid[i][j+1]==2:
                        edge.add((i,j+1))
                    if len(edge)==1:
                        return 1
                    e[(i,j)]=edge
        while e:
            a,edge=e.popitem()
            while len(edge)>1:
                if not isway(a,edge.pop(),edge):
                    return 1
        return 2  
93