A

Admin • 832.70K Points
Coach

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

Explanation by: Admin

brute force, recursion and dynamic programming can be used to find the submatrix that has the maximum sum.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.