Function dfs

javascript/0329-longest-increasing-path-in-a-matrix.js:30–46

(matrix, row, rows, col, cols, ans = 0)

};

var dfs = (matrix, row, rows, col, cols, ans = 0) => {
    for (const [_row, _col] of getNeighbors(row, rows, col, cols)) {
        /* Time O(4) */
        const path = dfs(
            matrix,
            _row,
            rows,
            _col,
            cols,
        ); /* Time O(2^(N + M)) | Space O(HEIGHT) */

        ans = Math.max(ans, path);
    }

    ans += 1;
    return ans;
};

var getNeighbors = (row, rows, col, cols) =>
    [