Search
⌘K
Get Premium
Leetcode 2536. Increment Submatrices by One
Given n and a list of axis-aligned submatrix queries that add +1 to every element in each rectangular region, compute the final n×n matrix; the core challenge is applying up to 10^4 rectangle updates efficiently (use the 2D difference array / prefix-sum pattern instead of per-cell updates).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.