DSA Level 2 Conceptual building blocks Dynamic Programming Largest Square Sub-matrix With All 1's

Largest Square Sub-matrix With All 1's

medium

Dynamic Programming

Question Solve Solutions

1. You are given a matrix of 0's and 1's.
2. You have to find the maximum size square sub-matrix with all 1's.

Input Format

A number N, which represents number of rows in matrix A number M, which represents number of columns in matrix arr1 arr2...N*M numbers

Output Format

Check the sample output and question video.

Constraints

1 &lt;= N,M &lt;= 100
0&lt;= arr[i][j] &lt;= 1

Example

Input

5 6
0 1 0 1 0 1 
1 0 1 0 1 0 
0 1 1 1 1 0 
0 0 1 1 1 0 
1 1 1 1 1 1

Output

Highway Billboard

Minimum Insertions To Make Palindrome

Related Questions

easy Super Ugly Number easy Burst Balloons easy Cherry Pickup easy Regular Expression Matching easy Rod Cutting easy Russian Doll Envelopes easy Scramble String easy Temple Offerings easy Word Break easy Optimal Strategy For A Game easy Longest Bitonic Subsequence easy Count Palindromic Subsequences easy Longest Common Subsequence easy Longest Common Substring easy Longest Increasing Subsequence easy Distinct Transformations