Problem of the day
Input: ‘N’ = 2 ,'GRID' = [[0,1],[1,1]]
Output: 4
Explanation:
Sam can plant a tree on the only remaining unplanted cell.
The first line of the input contains an integer, ‘T’, denoting the number of test cases.
The first line of each test case contains an integer, 'N’, denoting the size of the (NxN)campus.
The next ‘N’ lines of each test case contain N integers (0 or 1), denoting unplanted and plated area.
Return an integer, denoting the largest group of trees on the campus after Sam planted a tree.
1 <= T <= 10
1 <= N <= 500
GRID[i][j] is either 0 or 1.
Time Limit: 1 sec
2
2
0 1
1 1
3
1 0 1
0 0 0
0 0 0
4
3
Test 1:
Sam can plant a tree on the only remaining unplanted cell.
Test 2:
Sam can plant a tree between the two trees, so the largest group would contain 3 trees.
2
2
0 0
0 0
3
0 1 0
1 0 1
0 1 0
1
5