+ 1

# Divide and conquer challenge

I send you this challenge, create a program which gets a matrix of integers which can be positive and negative and returns the maximum sum of a rectangular submatrix in O(N^3) complexity using divide and conquer paradigm

4 Answers

+ 2

what should be the size of submatrix?

+ 2

ok, so size of submatrix can be variable.

0

it should be NÃ—M

0

Yes,that is right