Implementation of an algorithm to find the maximum size square sub-matrix
A compiler supporting the basic C++11 features
Time Complexity: O(mn) where m is number of rows and n is number of columns in the given matrix. Auxiliary Space: O(mn) where m is number of rows and n is number of columns in the given matrix. Algorithmic Paradigm: Dynamic Programming