Available question text
Given an m×n binary matrix, find the area of the largest axis-aligned square submatrix that contains only '1's. This is a classic DP problem (m,n ≤ 300) of computing the maximal square size at each cell and returning its area.
Related questions
Continue with questions that share topics or the same question type.
- Dungeon Game
Coding · Array · Dynamic Programming · Matrix
- Minimum Path Sum
Coding · Array · Dynamic Programming · Matrix
- Beautiful Arrangement
Coding · Array · Backtracking · Bit Manipulation
- Best Time to Buy and Sell Stock
Coding · Array · Dynamic Programming
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Expedia
Leetcode 221. Maximal Square
Reported Jan 13, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
eBay
Maximal Square
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 81. This is not an interview probability.
View source