Q191
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
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board