Maximum Subarray Min-Product | LeetCode 1856 | LeetCode Weekly 240 | Java | Hindi

Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skill ful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.

We also provide professional courses with live classes and placement opportunities.

DSA Level 1 and Level 2

Webinar on GATE Preparation

We are also available on the following social media platforms: -

HAPPY PROGRAMMING!
Pep it up.....

#coding #programming #pepcoding

[abhijitroy]

Amazing explanation and solution. 🎩 off to pep coding’s effort in bringing great and easy to understand solutions for really hard to grasp problems.

[rajatmangal]

Great Explanation Sir. Really appreciate it.

[niraj]

Logic is definitely clear..very good explanation.Samahj bhi aaya others video k respect me.But I think you should also explain concept behind NSEL/R a little bit or concept of monotonous increasing stack.Thats where confusion is which I am trying to resolve.

[ripuvendrasingh]

are of histogram similar...
addition is prefix sum

[ManishJain]

Pepcoding is my goto channel for every problem except this one. This explanation is not bad but missing a point on why we are doing it, check youtube video by Kacy codes also read leetcode solution. Solve brute force approach first. Main problem with BF is finding every subarray takes O(n^2) so we are going linear to find all subarrays for an element where current element is minimum, so let's say you find 5 subarrays where 7 is minimum that means you have to add 7, 5 times so 7*5 and do this for every element. That's the formula explained in pepcoding video.