Q. |
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 |
Answer» D. brute force, recursion, dynamic programming | |
Explanation: brute force, recursion and dynamic programming can be used to find the submatrix that has the maximum sum. |
Login to Continue
It will take less than 2 minutes