Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5642 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4610 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@sanskar94511 | 603 |

@akashverma4 | 363 |

@swastik8750 | 300 |

@nishunishuraj18 | 286 |

@surajmamgai | 264 |

@anks9013 | 222 |

@nayan2709 | 213 |

@burhanuddinbohra72 | 212 |

@realname | 203 |

@amank8975 | 203 |

@manmeetkaur18102000 | 202 |

Complete Leaderboard |

Given a 2D matrix M of dimensions RxC. Find the maximum sum subarray in it.

**Example 1:**

**Input:**
R=4
C=5
M=[[1,2,-1,-4,-20],
[-8,-3,4,2,1],
[3,8,10,1,3],
[-4,-1,1,7,-6]]
**Output:**
29
**Explanation:**
The matrix is as follows and the
blue rectangle denotes the maximum sum
rectangle.

**Example 2:**

**Input:**
R=2
C=2
M=[[-1,-2],[-3,-4]]
**Output:**
-1
**Explanation:**
Taking only the first cell is the
optimal choice.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **maximumSumRectangle()** which takes the number R, C, and the 2D matrix M as input parameters and returns the maximum sum subarray.

**Expected Time Complexity:**O(R*R*C)

**Expected Auxillary Space:**O(R*C)

**Constraints:**

1<=R,C<=500

-1000<=M[i][j]<=1000

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Maximum sum Rectangle

...