LeetCode 304 Range Sum Query 2D - Problem Statement

This is Range Sum Query 2D (two-dimensional) from LeetCode. Given a 2D matrix, handle multiple queries that each ask for the sum of elements in a rectangle defined by its upper-left $(row1, col1)$ and lower-right $(row2, col2)$ corners.

The 1D (one-dimensional) formula was $pref[r] - pref[l-1]$. For 2D, you need something more sophisticated. The 2D version needs $4$ prefix sum lookups per query using inclusion-exclusion on the rectangle corners.