[못풀었다/꼭다시풀기/프로그래머스] 가장 큰 정사각형찾기

function solution(board){
    const n = board.length
    const m = board[0].length
    let answer = 0;
    if(n<2||m<2) return 1
    for(let i=1;i<n;i++){
        for(let j=1;j<m;j++){
            if(board[i][j]!==0){
                board[i][j] = Math.min(board[i][j-1],board[i-1][j],board[i-1][j-1])+1
                answer = Math.max(board[i][j],answer)
            }
        }
    }
    return answer**2
}

DP를 이용해서 풀어야한다