[Programmers] Lv 2. 가장 큰 정사각형 찾기

https://school.programmers.co.kr/learn/courses/30/lessons/12905

프로그래머스

 

function solution(board) {
    return board.reduce((acc, rows, i, board) => {
        if (rows.length <= 1) return 1;
        if (!i) return acc;

        rows.forEach((column, j) => {
            if (!j) return;
            if (column) {
                board[i][j] = Math.min(board[i - 1][j - 1], board[i - 1][j], board[i][j - 1]) + 1;
                acc = Math.max(acc, board[i][j]);
            }
        });
        return i !== board.length - 1 ? acc : acc * acc;
    }, 0);
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/12905.%E2%80%85%EA%B0%80%EC%9E%A5%E2%80%85%ED%81%B0%E2%80%85%EC%A0%95%EC%82%AC%EA%B0%81%ED%98%95%E2%80%85%EC%B0%BE%EA%B8%B0

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드