All the solutions remove the minimum of down and peak from the sum without properly explaining the reason. Only striver's video explains exactly the reason and also how he came to it. This is the stuff that passes you interviews when you understand how to come to the solution. Just everybody copying a solution without understanding, in interviews you will be completely lost as to what to do and why to do. Thank you for the wonderful explanation
Livestream of weekly and biweekly leetcode needed 🫡✅✅✅or else answers video of each contest please bro 😔😔
1x feels like 0.5x to me after listening to all of his classes in 2.5x 😆
Is there anyone who completed the whole playlist?????
please run the code youself at last it shows error many times
In the 2nd approach, you also have to update the right's value in else case. Btw amazing explanation, loved the optimized approach.
All the solutions remove the minimum of down and peak from the sum without properly explaining the reason. Only striver's video explains exactly the reason and also how he came to it. This is the stuff that passes you interviews when you understand how to come to the solution. Just everybody copying a solution without understanding, in interviews you will be completely lost as to what to do and why to do. Thank you for the wonderful explanation
Is it patented approach
Best video in entire DSA
The last approach was mind Blowing .From my own i could not have imagined this approach.Thank you striver for this amazing video😄
the 2nd O(2N) doesn't seem to be working.... pls cross check
Small correction in O(2N) solution
Your videos makes my day awesome
SUPERB STRIVER SIR.
Sir please start making videos on strings and stacks
Great
What is the optimal approach if they asked for the resultant array ???
Using better variable naming for 2nd appraoch
suprisingly i came up with most optimal approach by myself, but did not come up with naive solution.
First like 🎉
Slope Approach is amazing