Function search

javascript/0329-longest-increasing-path-in-a-matrix.js:94–106

(matrix, row, rows, col, cols, memo)

        ); /* Time O(M) | Space O(M)*/

const search = (matrix, row, rows, col, cols, memo) => {
    const hasSeen = memo[row][col] !== 0;
    if (hasSeen) return memo[row][col];

    return dfs(
        matrix,
        row,
        rows,
        col,
        cols,
        memo,
    ); /* Time O(N * M) | Space O((N * M) + HEIGHT) */
};

var dfs = (matrix, row, rows, col, cols, memo) => {
    for (const [_row, _col] of getNeighbors(row, rows, col, cols)) {