MAXIMUM RECTANGLE

CodeChefOpen on judge ↗

Given a 2D array, find the maximum sum subarray in it. For example, in the following 2D array, the maximum sum subarray is highlighted with blue rectangle and sum of this subarray is 29. ![](https://media.geeksforgeeks.org/wp-content/cdn-uploads/rectangle-11.png). --------- ### Input - The first line of input will contain a single integer $M,N$. where M denotes the number of rows and N denot

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI