1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int solution(vector<vector<int>> board){
    int maxi = 0;
    if(board[0].size() <= 1 || board.size() <= 1){
        for(int i = 0; i < board[0].size(); i++){
            for(int j = 0; j < board.size(); j++){
                maxi = max(maxi, board[j][i]);
            }
        }
    }

    for(int i = 0; i < board[0].size() - 1; i++){
        for(int j = 0; j < board.size() - 1; j++){
            if(board[j][i] >= 1 && board[j + 1][i] >= 1 && board[j][i + 1] >= 1 && board[j + 1][i + 1] >= 1){   
                board[j + 1][i + 1] = min({board[j][i], board[j + 1][i], board[j][i + 1]}) + 1;
                if(maxi < board[j + 1][i + 1]) maxi = board[j + 1][i + 1];
            } 
        }
    }
    return maxi * maxi;
}