largest-1-bordered-square

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given a 2D <code>grid</code> of <code>0</code>s and <code>1</code>s, return the number of elements in&nbsp;the largest square&nbsp;subgrid that has all <code>1</code>s on its border, or <code>0</code> if such a subgrid&nbsp;doesn&#39;t exist in the <code>grid</code>.

&nbsp;
Example 1:

<pre>
Input: grid = [[1,1,1],[1,0,1],[1,1,1]]
Output: 9
</pre>

Example 2:

<pre>
Input: grid = [[1,1,0,0]]
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= grid.length &lt;= 100</code></li>
	<li><code>1 &lt;= grid[0].length &lt;= 100</code></li>
	<li><code>grid[i][j]</code> is <code>0</code> or <code>1</code></li>
</ul>

largest1BorderedSquare

Largest 1-Bordered Square

Array

Dynamic Programming

Matrix

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie