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

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 835. Image Overlap

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact