Maximal Square (Square with Max area consisting of all 1's in a binary matrix) | Dynamic Programming

[tejasbirsingh]

Is your feature request related to a problem? Please describe.
This is the algorithm to find the maximum area square in a matrix with all 1's consisting of 0's and 1's in 2D matrix. I would like to contribute its Dynamic programming algorithm.

Describe the solution you'd like
I will implement the algorithm in Java using Dynamic Programming which will solve this problem/question in O(nm) Time and O(nm) Space complexity where n is the number of rows and m is the number of columns

Additional context
Problem Statement:-
Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
Input: matrix = [["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]]

Output: 4

Input: matrix = [["0","1"],
["1","0"]]

Output: 1

Please Assign this issue to me for adding Maximal Square Dynamic Programming Problem Code.

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!