Available question text
Given which interior horizontal and vertical bars can be removed from an (n+1)×(m+1) grid, remove some subset to merge adjacent unit cells and form the largest possible square hole, and return its area. The core challenge is to use the sparse lists of removable bars (n,m up to 1e9 but <=100 removable indices) to determine the maximum consecutive removable spans in each dimension that yield the largest square side.
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 2943. Maximize Area of Square Hole in Grid
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source