Hey guys. I have a problem I need to solve with dynamic programming for the university. As I'm pretty new to Python I'm asking you for help.

The problem:

Given a mxn matrix of positive and negative integers, write code to find the square sub-matrix with the largest possible sum.

The problem is similar to this one, but it needs to be a square submatrix:

http://www.delbertbao.net/2012/01/25/ma ... em-matrix/

So any code or pseudocode would be very helpful.

Thanks