This is the first video I watched to learn how to solve this problem. I think it would at least take a few hours to have independently come up with this solution on my own.
cause storing the value of max value of each iterator before for 1st it should be none so 0 ; second stores 1 ; -> carries checks Math.max(current , before) process goes on ; for second it should goes like this storing the new Array(n).fill(0); then we can store at the index value works with the same for forward first
![ILLSLICK - KILLSHOT REMIX [FULL VERSION]](http://i.ytimg.com/vi/RIK8RrqIAzE/mqdefault.jpg)
AlgoJs really saved us js devs with these dsa content coz majority of dsa problems on yt are on py and java
literal OP solution,saw every other video but this is the best
This is the first video I watched to learn how to solve this problem. I think it would at least take a few hours to have independently come up with this solution on my own.
Thank you for all the videos, Please create video for Dijkstras algorithm, Thank you...
Keep uploading. This is very good explanation.
it would be good, if you slow down the speed at which you explain.
good video but the 2nd approach is described in rush..
Thank You So much !
You're welcome!
This is the best explanation of how to do this problem I’ve seen. Thank you!
I agree with you.
I don't code with js but it quite clean to undestand the logic.
Forward max should be
011222233333
Why 011122223333?
You're right. It's a typo
cause storing the value of max value of each iterator before
for 1st it should be none so 0 ;
second stores 1 ; -> carries checks Math.max(current , before)
process goes on ;
for second
it should goes like this storing the new Array(n).fill(0);
then we can store at the index value
works with the same for forward first