Given a $0$ indexed $m \times n$ integer matrix matrix, construct a $0$ indexed matrix answer of the same dimensions. Initially, let answer be identical to matrix. For every cell (i, j) where matrix[i][j] is equal to $-1$, replace answer[i][j] with the maximum value found in column j.

Return the matrix answer.

Constraints:

• m == matrix.length

• n == matrix[i].length

• $2 \leq$ m, n $\leq 50$

• $-1 \leq$ matrix[i][j] $\leq 100$

• The input is generated such that each column contains at least one nonnegative integer.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.