Sum of Subarray Minimums | Detailed | Leetcode 907

[@varunbhargavmoori7815]

This is the only perfect video for this problem in the whole internet.

[@codestorywithMIK]

Thank you so much ❤️

[@lalitk]

Right 😊😊😊❤❤

[@sehajdhawan580]

Right I watched so many videos before coming to this due to its length 😅

[@technologicalvivek7510]

@@sehajdhawan580 Right

[@gui-codes]

agree

[@harikuduva]

I don't even speak hindi and I understood your explanation more than those other videos explaining in english. Great work.

[@aws_handles]

😮😮😮

[@codestorywithMIK]

You made my day. Thank you so much ❤️❤️🙏🙏

[@footballcreativeeverywhere260]

East or west hindi is the best❤️😂

[@RajanSingh-xr7cf]

oh angrej ke chode ................ jyada gyan mt de bhai ko hindi aati ni haii ....

[@aryansinha1818]

Man who are you, "Best explainer I guess". How can you explain so good. Hats off to you. Thank you from bottom of my heart. Love and respect always. It felt like I am binge watching Netflix. It was that smooth and crisp and clear.

[@dumbstonks]

Bhai don't ever stop uploading such detailed intuitive videos, these are like finding gems in a junkyard

[@nagmakhan672]

There is literally no video which gone to this depth for this Qn Thanks a lot 😊

[@ramprasath3818]

This channel is gold. The way he explains it step by step by walking through what he thinks, is really great. And I don't even know Hindi lol. Thanks a lot.

[@codestorywithMIK]

Thank you 😇🙏❤️

[@Gameplaywithmr]

bahut clear hai concept is video ke baad, thanks you so much. shaandar jabardust dindabaad😀

[@codestorywithMIK]

Thank you 😇🙏

[@pranavkhatri30]

Till now, I have watched multiple videos for this concept. Couldn't find better explanation than this. Worth watching!

[@codestorywithMIK]

Thank you so much Pranav ❤️❤️❤️

[@Rajsingh-bh4qw]

literally i watched so many videos but couldnt find a better explanation than this one. Thanks a lot sir🙏🙏🙏 each and every doubt is clear and also the edge cases.

[@codestorywithMIK]

Thank you Raj 😇💕

[@technologicalvivek7510]

mene 3,4 videos dekhe youtube pe iss question ka point of view samajhne ke liye but ek bhi youtuber depth me bata nhi paye ,jis depth me aapne bataya. Thank you.

[@codestorywithMIK]

❤️🙏

[@shadowgamer8105]

Sir love you dil se sachhi bole rahe hai aapke jaisa bhot kam log free mein intuition provide krta hai literally thank you sir 👌👌

[@codestorywithMIK]

If you are wondering how we come up with the formula at 12:06 - Let's take an example shown below : _, _, _, 2, _, _ If you notice- No. of ways to start our subarray from left of 2 (including 2) is = 4 (i.e. we have 4 possible starting points) No. of ways to end our subarray at right of 2 (including 2) is = 3 (i.e. we have 3 possible endings for our subarray) As per above two equations, For each starting point we have 3 ending points possible Total = 4*3 = 12

[@RaviTeja-cq6pu]

_, _, _, 2, _, _ how is it possible to start from 2. could you please explain.......

[@anuragv400]

@@RaviTeja-cq6pu take one scenario where you started and ended on 2.

[@fettuccine794]

This is the exact thing I was searching for in the entire internet, thank you So much ❤❤❤❤

[@10minutes_cs]

still if u find it confusing , here is simple derivation. let the number of elements before given element (eg: 2) be "b", and after given element (eg: 2) be "a", so , total number of subarray will be b // [3,4,5, 2] , [4,,5,2] , [5,2] a // [2,3,4], [2,3] 1 // [2] b*a // 9:07 cases so equation is b + a + 1 + (b*a) .. if u solve this its equal to (b+1)*(a+1)

[@gui-codes]

Bekar hi itne videos dekhe. Pehle hi is channel me ajana chaie tha. Bhai tumse acha isko koi nahi explain kar sakta. hats off to you

[@anddevsahil]

I got stuck on this edge case only while coding . Thanks man for clearing the doubt.

[@wearevacationuncoverers]

This is the only best explanation I found for this problem. You are too good. Let's support this Legend and make him famous.

[@eng.gaming5557]

Perfection belongs to one and only Mazhar Khan Sir... Thanks for ur efforts

[@codestorywithMIK]

❤️❤️🙏🙏means a lot

[@sayantanpoddar5428]

I search all over internet for those videos which have brute force solution .....and after that i found this channel and here only i got step by step thinking towards optimal solution ............near about 60 days i follow this channel and explainations are really great

[@codestorywithMIK]

Means a lot ❤️❤️🙏🙏

[@codestorywithMIK]

Means a lot ❤️❤️🙏🙏

[@DevOpskagyaan]

No one, I repeat no one can teach like this LEGEND

[@Danish-saifi1]

You are creating a gold mine for future programmers ❤❤ loved the way of explanations Zero rote learning only concept ❤

[@codestorywithMIK]

Thank you so much ❤️

[@souravjoshi2293]

First , your voice just makes me feel that the Qn is too easy and the way you explain , everything seems so effortless.I am still speechless with the amount of effort you put in a video. Thanks and congratulations for being such an impactful tutor. I can sense of urge in your voice to transfer the knowledge to us. People will soon start knowing you from this channel. Thanks from me and my friends in college who have started following you ❣

[@codestorywithMIK]

This comment made my day. Thanks a lot ❤️❤️❤️

[@shikharmalik3787]

this guy got some great voice...every question feels easy after that///

[@ankitgupta7467]

That's called a mindblowing explanation!!! Amazed at How I stayed here for 49 minutes, It was worthwhile.

[@rounaq_khandelwal]

You are absolutely right, others have directly written the code w/o proper explaination!! Thanks a lot Mik Bhai for this wonderful video

[@codestorywithMIK]

Thank you so much 😇❤️🙏🙏

[@jagdishkhetre4515]

Thank you so much for detailed Explaination ...[ Formula :-> i - NSL[i] * NSR[i] - i ]

[@tsukuruuu]

Great content as usual. Whenever i search any question and notice that you have made a video on that, i immediately click on it without a second doubt , no matter how long the video. Please don't stop making and uploading such videos! You truly are a gem! Thank you sm!

[@codestorywithMIK]

Thank you so much. Means a lot to me 😇🙏

[@theshlok]

Probably the only video which is able to actually explain the intuition behind this problem.

[@codestorywithMIK]

❤️❤️🙏🏻🙏🏻

[@jayashankarmaddipoti6964]

As usual, I was able to solve using a brute force approach and received a time limit exceeded error. No one born with enormous reasoning/analytical skills so as I. No need to worry, check who else solved the problem before, understand the approach and follow it. There is no mistake in following others when you are not sure. Thanks, MIK bro. No stop to learning. One day, I will become a pro of programming.

[@codestorywithMIK]

Definitely 💪💪💪 Keep going 🔥

[@riyadhossain1706]

Literally, amazed by the way you elaborate on the solution.

[@codestorywithMIK]

Means a lot Thank you 😇❤️

[@aadarshdontul5732]

Intuition.... is the main thing that way you have explained.

[@rahulkumarsingh4021]

what an explanation.Finally I was able to understand the solution .thank you bro.

[@harshitgupta8089]

Bhaiya I love you Your way of explaination is awesome I GOT THE BEST EXPLAINATION HERE FINALLY

[@codestorywithMIK]

Thank you so so much ❤️❤️

[@Raj10185]

This question is really amazing bas observation jaise kiya nsl and nsr se ho jyega bas question is very much standard bas formula figure out me thoda dikkat hua baki ab sab smoothly solve ho gya.

[@codestorywithMIK]

indeed

[@Abhay14]

thanks a lot bhaiya , sayad hi aapse acchha koi iss question ko samjha skta tha this topic was so deep and interested

[@nikhilsatyam4815]

awesome exlaination after striver you are the best tutor on youtube for dsa.

[@codestorywithMIK]

❤️🙏

[@shristisrivastava7054]

You always explain the logic so well. Hats off to you!

[@Kings-ik9lh]

we can also check left and right elements at the travrsal time of index also but it will take Time complexity O(N^2) but space complexity will be O(1) int mod = 1e9 + 7; int sumSubarrayMins(vector& arr) { long long ans = 0; for(int i=0;i=0 && arr[j]>=temp){ leftcount++; j--; } int k = i + 1; long long rightcount = 0; while(ktemp){ rightcount++; k++; } ans=(ans%mod+(leftcount+1)%mod*(rightcount+1)%mod*temp%mod)%mod; } return (ans % mod);

[@Afiniciado]

best explanation found so far!!!

[@aadil4236]

Very Good explanation brother. I was only able to get it after watching your explanation. Kudos to you!

[@amlantribedi7954]

By Far the best Explanation in KZbin !

[@codestorywithMIK]

It means a lot. Thank you so much 🙏😇

[@NikhilRaj-wv6nf]

Mik, explained the entire concept with 50 min video lecture >

[@codestorywithMIK]

❤️❤️❤️

[@adityatomar9820]

god level explanation bhaii...i was struggling so much in this ques

[@robot3.077]

best explanation on youtube. fell in love with your explanation🙏🙏😍😍

[@codestorywithMIK]

🙏🙏❤️❤️

[@AMANRAJ-dt8gu]

The nicest explanation I have got as compared to other videos. Doing great job man🙏

[@shrijonbiswas8105]

U are a genius..keep making videos for such lesser known problems

[@codestorywithMIK]

It means a lot 🙏🙏❤️❤️😇😇 Sure I will be posting more

[@itssumit6161]

You are just awesome sir u made the question more easy with your explanation. ❤

[@AnjuGupta-sz1uk]

very clear explanation for each and every point of the problem...bhaiya your explanation is crystal clear ,like no need to go for any other videos for understanding the concept after watching your video.

[@codestorywithMIK]

Means a lot. ☺

[@tusharbhatia5437]

Beautiful explanation. Was able to code myself after your explanation itself thanks !

[@TejalKumawat-hu9yi]

best explaination on the internet for this question

[@codestorywithMIK]

Thank you ❤️

[@rahulverma9237]

beautifully explained, solved the sum of subarray ranges question by this method, keep up the good work

[@codestorywithMIK]

Thank you so much 😇❤️🙏

[@geekieyyy]

your explanation is awesome , I understood in one go,, It's better to watch one video of 50 minutes in detail rather than 5 to 6 videos of each 20 mins.

[@codestorywithMIK]

Thank you so much ❤️😇🙏

[@tryin_to_code]

I tried to do this question using Sliding Window technique and following is the code that I have written : class Solution { public: int sumSubarrayMins(vector& arr) { vector result; deque deq; int n = arr.size(); int k = 1; while(k

[@niteshk0487]

Bhai God Level explanation❤✅

[@codestorywithMIK]

Thanks a lot Nitesh ❤️❤️❤️

[@it17harshahuja81]

Liked only because of the Edge Case👍👍👍👍

[@shivamnirmalkar6251]

//vector getNSL(vector& arr, int n) , bhaiya aapne yaha NSL likh rakha hai or aap for loop se travel kr rhe right side //for(int i = 0; i

[@subhamoysasmal8382]

sir you are simply great

[@RV-qf1iz]

thanks bro i was able to solve this problem on my own after understanding the logic.

[@codestorywithMIK]

Glad to hear that 😇❤️🙏

[@oknokok]

Best explanation

[@thekindspill]

One of the best explanations

[@rajubali5627]

super sir...this is perfect explanation......

[@gauravbanerjee2898]

Thanks a lot bhaiya ❣️ this was the best explanation for this question among all of the other explanations I have seen so far

[@codestorywithMIK]

Most welcome 😊

[@RajanSingh-xr7cf]

sach mai great explation _____________

[@gocrazy6177]

How can someone be so good at explaning logics ??

[@codestorywithMIK]

🙏🙏🙏❤️❤️❤️

[@gocrazy6177]

@@codestorywithMIK 🙏🙏🙏 bless me sir

[@pankaj_2003]

best explaination i hv got fr this question ,thankyou so much ........

[@raisanjeeb42]

What an explanation Loved it how you built the intuition...So simple and easy to understand Thanks

[@codestorywithMIK]

Thank you so much ❤️❤️❤️

[@raisanjeeb42]

@@codestorywithMIK If u get time..Please make solutions on leetcode contests. You're explanations are so helpful

[@codestorywithMIK]

@raisanjeeb42 sure thing Sanjeeb. I am soon planning to take out time for that Thank you for understanding ❤️❤️❤️

[@raisanjeeb42]

@@codestorywithMIK Much Appreciated for your reply and taking time to make this wonderful explanations

[@footballcreativeeverywhere260]

Great mik bhai❤

[@anveshasharma2726]

very nyc explaination. support from haryana

[@codestorywithMIK]

🙏🙏❤️❤️😊😊

[@VedBrahmbhattBEE]

Best Explanation for this problem!! Thanks Sir : )

[@ankitasantape1063]

Thanks a lot Sir for this wonderful in depth explanation.

[@codestorywithMIK]

You are most welcome 🙏

[@sz.110]

*New Test cases Has Been Added* Overflow aaraha hai toh *long long* ka use karein

[@codestorywithMIK]

Thanks Sajjad ❤️❤️

[@this_is_ur_ms]

Great Explanation, cleared everything. Thankyou.

[@chillkro25]

One of the finest explanation ❤

[@codestorywithMIK]

Thanks a lot 😊

[@chillkro25]

@@codestorywithMIK 🙏🙏🙏

[@chiragsharma8905]

Subscribed❤. Loved the explanation.

[@codestorywithMIK]

Thank you so much ❤️❤️🙏🙏

[@vishalgaurav4193]

Now I finally subscribed your channel after this great explanation👍.Really impressed with the way you explain this problem easily

[@ritikabisht2055]

Really nice and detailed explanation ❤

[@viidhudubey8573]

very well and thoroughly explained, Thank you for this

[@codestorywithMIK]

Thank you so much 😇❤️

[@dayashankarlakhotia4943]

Very beautiful explanation and much intuitive thanks

[@codestorywithMIK]

You're most welcome 😇

[@arthurlewin1952]

Amazing explaination sir solve largest rectangular area of histogram using this

[@codestorywithMIK]

Sure Arthur. Thanks a lot I will soon upload Histogram one

[@reemakumari9495]

love you sir ...finally abb samajh aaya

[@bhuppidhamii]

corner case 35:35

[@satyamkumaryadav1560]

as soon as i saw this problem i came to your video and as you told we need to find left smallest nearest aditya verma striked op mik you are op one hint : if you find two loops being used i being the outer loop j being the inner loop if j is dependent on i think of stack as in this question

[@codestorywithMIK]

Thank you so much ❤️❤️❤️

[@SamsIt-hi9gf]

bhai your explaination is op....

[@nitingoel258]

Very well explanation !

[@joydeep-halder]

Such a detailed explanation! Hats Off 🔥🔥 Earned a subscriber!

[@varunsheth1003]

Nice Explanation

[@thestrangers6433]

Best on youtube ❤

[@SurajKumar-ku1lg]

best video explanation of that problem

[@vishalanand878]

superb explanation🔥🔥🔥🔥🔥🔥

[@footballalliance2412]

Thank you so much sir, now i got the intuition.

[@ashutoshsingh285]

bhai you are legend ho.

[@dhruvaseri2082]

great work...

[@NatureLover-oq6uc]

Great explanation....

[@codestorywithMIK]

Thank you so much 😊

[@medhanshagrawal5787]

Just Perfect Broo. Loved it❤

[@ugcwithaddi]

Dope explanation Best one on internet 🔥

[@md.tamaltahasinkhan6448]

what a detailed explanation!!! ❤

[@bhuppidhamii]

when i did this Q's 3-4 weeks ago I fully understood it. but now today when i'm doing POTD I still cannot able to come back that stack will be used in this Q's. Why is it happening, what to do to prevent this?

[@codestorywithMIK]

Hi there, It happens with me also. Don’t worry. I usually either try it for 30 minutes, if I don’t get it, i watch the solution and try to figure what exactly i was missing. Remember one thing : For any qn, firstly try the worst solution- Brute Force, then go to optimal. It helps you understand what was the reason that was causing the high time complexity in brute force, what exactly we should improve to make it optimal. This helps a lot. And keep practising more and more.

[@bhuppidhamii]

@@codestorywithMIK thank you for your kind words

[@akshatmishra9574]

That Was Damn Clean and Good Explanation Bro !!

[@ss8273]

thank you sir keep it up really helpful........😍😍

[@codestorywithMIK]

Most welcome❤️❤️

[@sjxsubham...]

best.... solution... thank MIK sir

[@MakeuPerfect]

You are superb

[@codestorywithMIK]

Thank you so much ❤️❤️❤️

[@deveshsharma-u2l]

thanks bro loved it !Thanks😘😘😘😘😘😍 Enjoyed it Dil de

[@iayushsharma]

Thankyou Mik for awesome content