Dynamic programming: Given a matrix consisting of 0's and 1's, find the maximum size sub-matrix consisting of only 1's.
To find the maximum size sub-matrix within a binary matrix, I loop through each row and column of the matrix and create a histogram with each loop that tracks the total number of consectuvie 1s in each column from row to row. This builds a histogram with varying heights with each pass. For each pass, the histogram is sent to a seperate function that loops through each value in the histogram, storing the position and height of data point. The position and heights of each data point are then used to calculate the maximum size sub-matrix.
More details in the code.