Maximum Sum Rectangle | Extended Kadane's Algorithm | Dynamic Programming | DSA-One Course #93

Hey guys, In this video, We're going to solve the Maximum Sum SubMatrix Problem using Kadane's Algorithm.

🚀 Follow me on:

Hashtags:
#anujbhaiya #dsaone

Ignore these tags:

maximum sum rectangle
max sum of rectangle no larger than k
maximum sum submatrix
kadane's algorithm
max sum of rectangle
kadane algorithm
maximum sum rectangle in a 2d matrix
maximum sum square submatrix
anuj bhaiya
363. max sum of rectangle no larger than k
largest rectangular sub-matrix whose sum is 0
max sum submatrix
maximum sum rectangle in a 2d matrix leetcode
max sum rectangle
max sum rectangle no larger than k
max sum of rectangle no larger
maximum sum combinations
dynamic programming problems
maximum subarray problem
max rectangle
maximum subarray sum
maximum sum of rectangle no larger than k
maximum sum rectangular submatrix
maximum sum subarray
kadane
max sum of rectangle no larger than k leetcode
maximum rectangle sum
maximum subarray
maximum sum increasing subsequence
maximum sum rectangle problem
6148. largest local values in a matrix
kadanes algorithm
kadane’s algorithm
kadens algorithm
longest sub-array with sum k
max subarray sum
max sum of rectangle no longer than k
max sum subarray
maximum subarray leetcode
1d array in java
2d kadane
363 leetcode
6193. maximum sum of an hourglass
algorithm programming
anuj bhaiya java
brute force approach
c++ dsa course
dynamic programming
dynamic programming tutorial
equal sum arrays with minimum number of operations
java anuj bhaiya
k-concatenation maximum sum
kadane's algorithm java
leetcode 363
love babbar microsoft
matrix block sum
max sum of rectangle no larger than k java
max sum of rectangle no larger than k leetcode java
maximal rectangle
maximize or sum
maximum
maximum index
maximum path sum
maximum sum circular subarray
maximum sum combination
maximum sum of rectangle
maximum sum rectangle no larger than k
nodes at distance k
prim's algorithm
sub matrix
subarray with given sum
sumeet malik
two sum leetcode

[abhishekrai]

Nice explanation. A correction I'd like to share : best of brute force approach is O(n^4), using precomputed matrix sum, sum of a sub matrix can be found in O(1) time, and n^4 for choosing the diagonally opposite end points.

[satvrii]

Among all the videos for this question, this is the only one with clear and good explanation ❤❤❤❤❤❤❤

[reetikbasniwal]

In the beginning, when we are adding the last col to c0 at the time stamp 5:26, at the third index it should be 24 instead of 6, isn't it?

[_zencored]

i love you man better than my teacher

[nidhigupta]

Can maximum sum submatrix less than given sum be done with same approach with some modification ?

[akifahmed]

Great approach but I think for beginners it would be little tough visualise how kadane's algo is helping to calculate sum. Had you delved deeper into the concept and showed how it will always bring out the right result it would have been way more informative but nonetheless the video was worth watching.

[blackhawk]

It would be easier to code if, we went the other way..
Like going adding row to previous row, instead of columns

[abhilash]

Watch the videos at 0.9x speed for best understanding

[JEMohammadAtif]

isme dp kaha aur kaise lagi, can anyone tell

[prathmeshadsod]

this works but what is its proof that every time we will get rectangle when doing sum.

[sanikmishra]

Very very thanks sir😍❤
Bus placement lg jaye

[sunnysaini]

Bhaiya details ch study krna hove, aapke pass online course hai kya DS ke liye

[BadalSharmaMEA]

Bhaiya ji ye series kab tak Puri ho jayegi

[blackhawk]

Um, - sums of the third row are incorrect at times..

[tanmaykumar]

why we are taking sum of pairs of columns? who are we able to solve in that way?

[alexandrossantexis]

would be nice if not just the title was in english

[udhayasankar]

Bro pls add subs to the videos that doesn't have yet

[mindsoulvalley]

Bhaiya plz include subtitles bhaiya.. I don't know hindi and it's difficult to understand