Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3195. Find the Minimum Area to Cover All Ones I
Given a binary matrix, find the minimum-area axis-aligned rectangle that contains every 1 by determining the extreme rows and columns where 1s appear. Return the rectangle's area (grid size up to 1000×1000).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.