Topic: Divide And Conquer Problem / Level: intermediate

Problem: Use divide and conquer to find the maximum size of a square sub-matrix that contains all 1s.

Run the code to see the output here...