After watching the DP Approach this greedy code is far very easy .

Striver, your DSA Sheet is absolutely phenomenal! It's been an invaluable resource for mastering data structures and algorithms. Looking forward to the remaining topics, especially the much-anticipated sections on strings and heaps. Thanks for all your hard work!

i thought about recursion approach but this is really easy and optimal

Waiting for strings ...

Radhe Radhe bhaiya 💖

waiting for String playlist ❤ and till now all the videos of greedy are osm

Good morning striver !

thanks for the solution

Mind Benging brooo

awesome

Best solution

ty sir

Understood

Thankyou so much Striver for all you efforts throughout in delivering us so much valuable content. Any student / working professional can now be able to transition their career without paying money for courses. Would also like your insights on the point : While preparing for interviews most of the aspirants are going through the videos solely and solving the question after completely watching the video. And also are feeling lazy trying to solve the question on our own. What is the best way to complete any topic without being lazy and how should an aspirant approach any topic/playlist?

@abhavgoel9390

18 сағат бұрын

by not watching the video first and try to solve the question beforehand. And you talk about laziness to solve a question that help you land a job bro, you shouldn't be even asking this question if you were motivated enough

Hey striver,in DSA a to z course there is no video on Java collections

Please add the links of these new videos to the A2Z Dsa sheet

what if there are multiple zeroes in the array; than the method doesn't seem to work?

❤

Stack and Queue ki playlist daaldo bro please, eagerly waiting. Mail bhi kia thha poochhne ke lie but you did not reply

please add link to this video in your a2z sheet

please,anyone can explain intution behind it, why he is not using dp here

@rohithkarthikeya2686

18 күн бұрын

This is similar to Buy and sell stock 1 here basically we need to figure out whether we can able to jump to last index or not so let's say as he mention from particular index I he can jump to at max 6 and try to traversing the array by calculating from that index what is the jump possobile at any moment lets at index I he can go to max of x but to reach till I the max possible jump we can take is y if y

waiting for Strings playlist

paaji tussi great ho taufa kabul karo

@Ahnos

Ай бұрын

😂😂

prefix coding pattern

please bring the string video first .A humble request from us

please bring the string video first .A humble request from us