Coin grid question getting MLE

#1

I am getting an error in coin grid I keep getting memory limit exceeded… wht should I do

#2

the question name is gold grid*

#3

@alexrocko90
Just take prefix sum of every row and after that take prefix sum of every column.
Then if you partition the (i,j)th of grid then your top-left box sum will be the value at (i,j)th index of grid
and top-right box sum will be the sum at that row’s last column - the sum of top-left box sum
and bottom right box sum will be the value at (n,j)th of the grid - the sum of top-left box
and bottom-right box sum will be the value at (n,m)th of grid - top-right box sum - bottom left box sum + the sum of the top-left box ( because it gets subtracted two times, the first time in top-right box sum and the second time in bottom-left box sum ).
Make ans at every step as
ans = max ( ans, min( all four boxes) );
You can see my implementation, I have commented on the part for better understanding. It’s better if you try on a notebook with one small example to have a crystal clear understanding.