Leetcode 835. Image Overlap

Given two n×n binary matrices, find the maximum number of positions with 1s in both matrices obtainable by translating (shifting) one matrix over the other without rotation. The core challenge is efficiently enumerating translations (e.g., by counting translation vectors between 1-cells or via convolution) to maximize overlapping 1s (n ≤ 30).