Available question text
Given an m×n (m,n ≤ 30) binary grid, partition all 1-cells into three non-overlapping axis-aligned rectangles of non-zero area (rectangles may touch) whose union covers every 1, and minimize the total sum of their areas. The core challenge is finding the optimal way to group 1s into three disjoint bounding boxes under the non-overlap constraint.
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 3197. Find the Minimum Area to Cover All Ones II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source