Available question text
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).
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
No company association
Leetcode 835. Image Overlap
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source