Available question text
Count the number of non-empty submatrices in a 2D integer matrix whose elements sum to a given target. The common approach reduces the 2D problem to many 1D subarray-sum problems by fixing row pairs and using prefix-sum + hash counting (O(rows^2 * cols), feasible for up to 100x100).
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
Meta
Leetcode 1074. Number of Submatrices That Sum to Target
Reported Jan 15, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source