Given a 2D matrix, find a submatrix that has the maximum sum. Which of the following methods can be used to solve this problem?
(a) Brute force
(b) Recursion
(c) Dynamic programming
(d) Brute force, Recursion, Dynamic programming
I had been asked this question during an online exam.
Query is from Maximum Sum Rectangle in a 2D Matrix topic in chapter Dynamic Programming of Data Structures & Algorithms II