Maximum Sum Rectangular Submatrix - Dynamic Programming/2D Kadane's Algorithm

[algocademy]

RECOMMENDED VIDEOS FOR YOU
If you liked this video, you'll love these ones:

[dennis]

Italian student here :) Wonderful and intuitive explanation, thank you really much!

[prakharagarwal]

Wow! Your explanation is just awesome!

[harshitpruthi]

Hands Down! So Far, Best Explanation, I have come across for this question
But although Time complexity should be O(min(n, m)^2*max(n, m))? Am I right?

[ayushvarma]

Such a nice explaination. Thank you so much!

[abhijit-sarkar]

It feels weird to approach the problem to fit a target time complexity. Some problems specify an upper bound for time and space complexities, but this is not one of those problems. More commonly, an algorithm is laid down, time complexity calculated, and the question is asked: Can we do better? No one starts an algorithm by pulling the optimal time complexity out of a hat.

[nobody]

Bro, you got my subscribe... Best explanation 👍

[robert]

Thanks a lot! I did understand everything!(you helped me solving a problem on TIMUS btw :D)

[swswisssw]

finally i totally understood it..thanks a lottt <3

[CarterChen]

For the brute force approach, the total number of rectangle is not given by (m*m)^2, this formula will give wrong answer. the correct one is 225 rectangles.

[EdinssonMelo]

It can't be solved in O (nxm) with prefixes sum?