Count the Number of Incremovable Subarrays II | Leetcode Biweekly 120

*************************************************

*************************************************
Timestamps -

00:00 - Agenda
00:35 - Problem Description
02:10 - Brute force solution
04:50 - Pseudo code & Time Complexity
08:32 - Intuition to optimise the inner-loop
13:25 - Dry run of the Algorithm
16:40 - Pseudo code & Time Complexity
17:25 - Intuition to optimise the solution further
25:05 - Dry run of the Algorithm
30:52 - Code Walkthrough

*************************************************
Interview Experiences Playlists -

*********************************************************************

Please show support and subscribe if you find the content useful.

[akshardhondiyal]

I don't comment usually, and I have only seen half this video, but love your approach and the way you explain your thought process by breaking down each part. Amazing! you definitely deserve more subscribers! Comparing your channel with something like neetcode, your thumbnails are lacking. You are already super consistent, so all you need to do is use the same critical thinking in debugging why your channel is not exploding? Could be competition but I am pretty sure if you can solve this question, you can figure it out. Unless you don't care about the money. But I would argue that you should get what you deserve and solving why you are not blowing up might be a leetcode hard question in itself(could be super fun and rewarding). Either ways, thank you! and You got this!

[gauravprashantsinha]

amazing explanation loved it if possible please make more videos of more tricky problems of leet code contests

[dakshsagar]

really helpful ! Thanks a lot for doing this 🙌

[sainikhilpalukuri]

I think

good_till_l = l-1<=max_good_in_left

good_till_r = r+1>=max_good_in_right


Please correct me if i m wrong