Count the Number of Incremovable Subarrays II | Leetcode Biweekly 120
Segment Trees Series - bit.ly/segment-trees
*************************************************
Contest Link - leetcode.com/contest/biweekly...
Problem Link - leetcode.com/contest/biweekly...
Solution - leetcode.com/problems/count-t...
*************************************************
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 -
Microsoft - • Microsoft Interview Qu...
Amazon - • Amazon Interview Quest...
D.E.Shaw - • D.E.Shaw Interview Que...
Linkedin - • Linkedin Interview Que...
Facebook - • Facebook (Meta) Interv...
*********************************************************************
Please show support and subscribe if you find the content useful.
Пікірлер: 15
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!
@sandeeptottadi
6 ай бұрын
Correct, i usually watch videos which have decent thumbnails, and this channel doesn't even have a profile picture, that is the reason at first i skipped the video even though it showed on the top.The other video i watched was not that informative finally clicked this video and How he explained every step was amazing actually. I've only been following neetcode for a while for leetcode, definitely gonna try this channel.
Great explanation 🎉
dude thanks for the solution
Very helpful bro❤
amazing explanation loved it if possible please make more videos of more tricky problems of leet code contests
Ur gem🎉
really helpful ! Thanks a lot for doing this 🙌
can you share your codeforces id
I think good_till_l = l-1=max_good_in_right Please correct me if i m wrong
@loserfruit9663
7 ай бұрын
You are right, I also wasted a lot of time in proving that cond right and end read your comment, correct us if we are wrong
@saurabhsingh-zm9zh
6 ай бұрын
same here 2 hr ...i think it was error but he explained very well
just wow
Sir please try explain in hindi