I think many people here might have come across the maximum sum rectangle problem. [Link](https://en.wikipedia.org/wiki/Maximum_subarray_problem)\n\nThe best this can be solved is at a time complexity of O(n^3). If we consider only a square submatrix, is it possible to improve the time complexity?\n\nThanks

I think many people here might have come across the maximum sum rectangle problem. Link\n\nThe best this can be solved is at a time complexity of O(n^3). If we 