Leetcode 3033. Modify the Matrix

Given an m x n matrix, return a new matrix where each entry equal to -1 is replaced by the maximum value found in its column (each column is guaranteed to contain at least one non-negative).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3033. Modify the Matrix

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact