Maximal Square of Ones
Maximal Square of Ones
HardDynamic Programming0% accepted
Your solve(...) function receives these inputs directly as ready-made arguments — no input reading or parsing needed. Just compute and return the answer. DP: dp[i][j]=1+min(top,left,top-left) when cell is 1. Input: first line two integers M and N; next M lines each with N integers. You are given solve(m, n, grid) where grid is an M x N 2D array.
Approach
Given a binary matrix (0/1), find the AREA of the largest square containing only 1s. Print 0 if none.
Input
1 1
1
Output
1
- •
1 <= M, N <= 8.
More Dynamic Programming problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards