Regarding the complexity

Revision en2, by Shellhead96, 2017-08-15 13:36:39

Given a matrix of ‘O’ and ‘X’, find the largest subsquare surrounded by ‘X’? Can there be a better solution than O(n^3) ??

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Shellhead96 2017-08-15 13:36:39 1 Tiny change: 'ded by ‘X’\nCan ther' -> 'ded by ‘X’?\nCan ther'
en1 English Shellhead96 2017-08-15 13:36:13 147 Initial revision (published)