Find Maximum Sum (Dynamic Programming)

Given a 2-dimensional array of positive and negative integers, find the sub-rectangle with the largest sum.

The 2D array will be an NxN matrix.

Input N: (mild input validation added)