<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:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
         map<pair<int,int>,bool> m;
       
        int count=INT_MIN;

        for(int i=0; i<grid.size(); i++){
            for(int j=0; j<grid[i].size(); j++){
                m[make_pair(i,j)]=false;
            }
        }

        for(int i=0; i<grid.size(); i++){
            for(int j=0; j<grid[i].size(); j++){
                    if(m[make_pair(i,j)]==false &&  grid[i][j]==1 ){
                        int temp=0;
                      //  cout<<endl;
                        queue<pair<int,int>> q;

                        q.push(make_pair(i,j));
                        m[make_pair(i,j)]=true;

                        while(q.empty()==false){
                            temp++;
                            auto t=q.front();
                            q.pop();
                            int x=t.first;
                            int y=t.second;
                  //          cout<<x<<" "<<y<<endl;
                            if(x+1 < grid.size() &&  grid[x+1][y]==1  && m[make_pair(x+1,y)]==false){
                                q.push(make_pair(x+1,y));
                                m[make_pair(x+1,y)]=true;
                            }

                            if(x-1 >=0 && grid[x-1][y]==1 && m[make_pair(x-1,y)]==false){
                                q.push(make_pair(x-1,y));
                                m[make_pair(x-1,y)]=true;
                            }

                            if(y+1 < grid[x].size() &&  grid[x][y+1]==1  && m[make_pair(x,y+1)]==false){
                                q.push(make_pair(x,y+1));
                                m[make_pair(x,y+1)]=true;
                            }
                            if(y-1 >=0 &&  grid[x][y-1]==1 &&  m[make_pair(x,y-1)]==false){
                                q.push(make_pair(x,y-1));
                                m[make_pair(x,y-1)]=true;
                            }

                        }
                       // cout<<temp<<endl;
                        count=max(count,temp);
                    }
            }
        }
        if(count==INT_MIN) return 0;
return count;
    }
};
36470