Medium Problemsgridoptimization
Maximum size square sub-matrix with all 1s
Given a binary matrix of 0s and 1s, find the side length of the largest square submatrix made up entirely of 1s.
Do this lesson first: longest common subsequenceThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.