<p>You are given an <code>m x n</code> binary matrix <code>grid</code>. An island is a group of <code>1</code>&#39;s (representing land) connected <strong>4-directionally</strong> (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.</p>

<p>The <strong>area</strong> of an island is the number of cells with a value <code>1</code> in the island.</p>

<p>Return <em>the maximum <strong>area</strong> of an island in </em><code>grid</code>. If there is no island, return <code>0</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/05/01/maxarea1-grid.jpg" style="width: 500px; height: 310px;" />
<pre>
<strong>Input:</strong> grid = [[0,0,1,0,0,0,0,1,0,0,0,0,0],[0,0,0,0,0,0,0,1,1,1,0,0,0],[0,1,1,0,1,0,0,0,0,0,0,0,0],[0,1,0,0,1,1,0,0,1,0,1,0,0],[0,1,0,0,1,1,0,0,1,1,1,0,0],[0,0,0,0,0,0,0,0,0,0,1,0,0],[0,0,0,0,0,0,0,1,1,1,0,0,0],[0,0,0,0,0,0,0,1,1,0,0,0,0]]
<strong>Output:</strong> 6
<strong>Explanation:</strong> The answer is not 11, because the island must be connected 4-directionally.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> grid = [[0,0,0,0,0,0,0,0]]
<strong>Output:</strong> 0
</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;= 50</code></li>
	<li><code>grid[i][j]</code> is either <code>0</code> or <code>1</code>.</li>
</ul>

class Solution {
public:
    vector<int> dx ;
    vector<int> dy ;   
    int bfs ( vector<vector<int>>&grid , int r , int c ){
        int result =0 ;
        queue<pair<int, int>> q1 ;
        q1.push({r,c});

            grid[r][c]=2;
        while(!q1.empty()){
            pair<int, int> p = q1.front();
            q1.pop();
            result ++;
            int i = p.first;
            int j = p.second;
            cout<<i<<" "<<j<<endl;

            for (int k =0 ;k<4;k++){
                if (i+dx[k]>=0 &&i+dx[k]<grid.size() && j+dy[k]>=0 && j+dy[k]<grid[0].size()&& grid[i+dx[k]][j+dy[k]]==1){
                    q1.push({i+dx[k],j+dy[k]});
                    grid[i+dx[k]][j+dy[k]]=2;
                }
            }
        }
        return result ;
    }
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int result = 0 ;
        dx= {1,-1,0,0};
        dy= {0,0,1,-1};

        for (int i =0 ;i<grid.size();i++){
            for (int j =0 ;j<grid[0].size();j++){
                if (grid[i][j]==1){
                    int temp =  bfs (grid , i , j);
                    cout<<temp<<" "; 
                    result = max (result ,temp);
                }
            }
        }
        return result ;
    }
};
31150