Max sum rectangle in 2D Matrix | Optimal Approach | Solution + Code | HIndi

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Brute force method will have time complexity 0(n^6) not 0(n^5)

ayushgarg
Автор

Awesome Explanation! Crisp and Clear!♥

tanmaythaker
Автор

bro you helped me big time keep the good work 👍

adityaraghav
Автор

sadhaaran bhasha me mast bata diye.. long pending algo sorted!! cheers, thanks a lot!

gautamtyagi
Автор

Thank-you so much...finally done now :)

RitikSharma-pcyj
Автор

Bhai rowsum calculate krne ke liye prefix array bhi use kr skte hai kya?

abhishekahlawat
Автор

hey, why are we adding columns before applying kadane's, I know that we've to always consider a single 1d array to apply kadane's, but why are we actually adding all column values, what's the actual logic behind this.

mrinmoyhalder
visit shbcf.ru