TomoLink
CompaniesZeptoData Structures & AlgorithmsRange Sum Query 2D - Immutable
DSA
MediumArray

Range Sum Query 2D - Immutable

arraydesignmatrix

Problem Statement

Given a 2D matrix matrix , handle multiple queries of the following type:

Calculate the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2) .

Implement the NumMatrix class:

NumMatrix(int[][] matrix) Initializes the object with the integer matrix matrix .

int sumRegion(int row1, int col1, int row2, int col2) Returns the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2) .

You must design an algorithm where sumRegion works on O(1) time complexity.

Examples

Example 1
Input:
Output:

Constraints

m == matrix.length
n == matrix[i].length
1 <= m, n <= 200
-10 ^4 <= matrix[i][j] <= 10 ^4
0 <= row1 <= row2 < m
0 <= col1 <= col2 < n
At most 10 ^4 calls will be made to sumRegion .
🤔
Medium
Difficulty
Topic Info
ModuleDSA
CategoryArray
Sub-topicDesign
Tags
arraydesignmatrixprefix sum
Navigation
Range Sum Query 2D - Immutable [Medium] | Zepto Dsa | TomoLink