Problem: Max Sum of Rectangle No Larger Than K

Hard

40 min

Not attempted

Try to solve the Max Sum of Rectangle No Larger Than K problem.

Statement

Given an $m \times n$ integer matrix matrix and an integer k, return the maximum sum of a rectangular submatrix whose sum is less than or equal to k.

It is guaranteed that there will be at least one rectangular submatrix with a sum no larger than k.

Constraints:

m == matrix.length
n == matrix[i].length
$1 \leq$ m, n $\leq 100$
$-100 \leq$ matrix[i][j] $\leq 100$
$-10^5 \leq$ k $\leq 10^5$

Examples

Fetching Slides...

Understand the problem

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Max Sum of Rectangle No Larger Than K

For the input matrix = [[-100]], k = -50, what is the maximum rectangular submatrix sum that does not exceed (k)?

(-100)

(-50)

(0)

No valid rectangular submatrix exists

1 / 5

Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Sequence - Vertical

Drag and drop the cards to rearrange them in the correct sequence

Try it yourself

Implement your solution in the following coding playground.