Number of Submatrices That Sum to Target

Given a matrix and a target, return the number of non-empty submatrices that sum to target.

A submatrix x1, y1, x2, y2 is the set of all cells matrix[x][y] with x1 <= x <= x2 and y1 <= y <= y2.

Two submatrices (x1, y1, x2, y2) and (x1', y1', x2', y2') are different if they have some coordinate that is different; for example, if x1 != x1'.

Example 1
0 1 0
1 1 1
0 1 0
Inputmatrix = [[0,1,0],[1,1,1],[0,1,0]], target = 0
Output4
The four 1x1 submatrices that only contain 0.
Example 2
 1 -1
-1  1
Inputmatrix = [[1,-1],[-1,1]], target = 0
Output5
The two 1x2 submatrices, plus the two 2x1 submatrices, plus the 2x2 submatrix.

Constraints

  • 1 <= matrix.length <= 100
  • 1 <= matrix[0].length <= 100
  • -1000 <= matrix[i][j] <= 1000
  • -10^8 <= target <= 10^8

Asked at 4 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate