Glad you like it!

Because at the end, we are looking for our array to be all 0's example - [0,0,0,0] at the end. If you decrement more than 0, you'll get a negative number. So subtracting further after seeing a 0 will ruin the array.

What @dThapa966 said is correct. We want to make all the elements equal 0. For each query, we only need to choose a subset of elements in the range. This means that we can choose not to decrement any elements which are already 0

Thank you! I’m glad it was helpful and will continue to do as many contests as I can

Thank you! I’m glad it was helpful

No problem! I’m glad it was helpful

Absolutely! I’m glad you found it helpful

Thank you! I really appreciate it

Thanks! I’m glad it was helpful!

Thank you! Yea I think this would be considered to be a math/geometry problem.

It happens to all of us. The only way we can truly fail is if we stop trying so take a small break and get back to the grind

Glad it helped!

I think they are a pretty good indicator of the general difficulty but they are not exact. For example, if I see an 8 I’m pretty sure it’s going to be a very hard problem. On the other hand a 5 I sometimes find pretty easy or quite hard. It’s a good general guide but not exact.

@@RoadToFAANG1992 I see got it. Thank you.

@@RoadToFAANG1992 okay thank you so much. Btw how accurate is zerotrac? If I did say all 1200-1300, 1300-1400 level problems and understood them, could I expect to be able to do qn 1 consistently in contests. My target right now is to be able to do Qn 1 and 2 consistently. Seems for Qn 1 you need to be good with 1100-1400 level problems and for Qn 2 you need to be good with 1400-1800 level problems

I would say it depends on the contest. Recently the contests have become extremely hard to try and stop people from cheating using ChatGPT. If you can get to 1800 I would say for most contests you would be able to solve 3 questions but maybe only 2 in more recent contests. Q1 is usually very easy so as long as you are confident in your DSA I think Q1 should be fine. However in some recent contests Q1 have been medium even though they are a bit on the easier side

@@RoadToFAANG1992 I see!! Damn they are making them more difficult. Thanks for the feedback. I’m trying to do all weekly between 1200-1400 since my rating is at 1250 despite doing 900 LC. Basically starting over. My target is to hit 1700 or at most 1800 by next year

Of course! It’s a great resource hopefully it’s helpful for you

Thank you! I’m glad this video was helpful for you

Perfect! I’m glad I can help

Glad the content is helpful for you! I will keep creating it but also let me know what types of content would help you more!

Thanks! Glad you’re liking the content!

Thanks!

Glad it was helpful!

Glad you enjoyed it!

Glad you like them!

The description was definitely unclear. Leetcode really needs to to better with these contests

Glad it was helpful!

Me too. I was not able to get it in the contest. We just need to keep grinding and we will get there

That’s weird. Let me try to run it again. Maybe they tightened the constraints since after the contest

@@RoadToFAANG1992 let me know did it pass for you or not

The original solution is getting a TLE but if on line 18 you change it to `for count, x in pairs[:100]:` it will work. In this case we only go through the first 100 possible x values

That’s a great idea. Will definitely do that in future videos

Thanks! I’m glad it was helpful

Thanks you for subscribing! I’m glad you are enjoying the content

Thanks for the comment! Yes we could definitely do it this way with a hashmap as well. Using the array should still be a constant look up however, since we are just getting a specific index in the array and not traversing through the whole thing each time.

Glad it was helpful!

No problem!

Glad you’re enjoying the content!