Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 598. Range Addition II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source