Leetcode 598. Range Addition II

Given an m x n zero matrix and ops that each increment every cell in the top-left submatrix [0, ai) x [0, bi), return how many cells reach the maximum value — equivalently the area of the intersection of all such rectangles, i.e., min(ai) * min(bi) (or m*n if ops is empty).

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 598. Range Addition II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact