Maximal Square dynamic programming problem Problem 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. For example for matrix of 2*2 1 0 0 1 Area of largest square containing only one is 1.