Leetcode 1074. Number of Submatrices That Sum to Target

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).