Leetcode 2132. Stamping the Grid

Given an m x n binary grid and an unrotatable stamp of size h x w, determine whether you can place stamps (any number, stamps may overlap, must stay inside the grid and never cover a 1) so that every 0 cell is covered. The core challenge is to efficiently identify all valid stamp placements and verify their aggregated coverage (commonly solved with 2D prefix sums / difference arrays).