Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
💡 DP PLAYLIST: ruclips.net/video/73r3KWiEvyk/видео.html
Hey man, just wanted to say thank you for putting the time in to make these videos! They've been super helpful and I was able to secure a google offer as a result :)
Congrats, You deserve it! I'm happy the videos were helpful.
Congrats man!
Probably the best explanation out of LeetCode discussions and RUclips Videos combined.I love these visuals. Keep it up!
Thanks a lot for your channel. I've always hated doing leetcode but knowing that your solution videos exist makes life a lot easier.
Love the part that you said "what does the cache tell us? why do we have it" Really inspiring and engaging video! Thank you!!
Best Explanation I have ever come across. Subscribed.
Hey dude. you explain things nicely. Let's do leetcode 2158 too if possible. Thanks
It really makes me wordless. Very amazing, can't speak more
Good explanation and elegant solution
Brilliant as always!
Would you consider this problem under 0/1 knapsack pattern?
You are a genius😭
Thanks neetcode
Thanks my friend, your videos are just amazing :)
@neetcode, shouldn't the brute force time complexity be 3^n ? It's 3 choices, n times.
No, it's 3 choices only for the first house. For the rest of the houses it's 2 choices to avoid the adjacent house
Hey man, first of all, thank you very much for making these! I just wanted to ask why is this algorithm correct? I can't wrap my brain around it
Hey buddy i watch all your videos can you clear .whether all dp problems can be memorized or not ??
What if the number of color also varies ? can we solve it in similar way ?
Dude you da man!
Awesome explanation. Even a dumb head like myself could understand
thanks
I solved this in codechef
can share link
please solve todays leetcode challenge. It is very tough . Please bro
Annyone has recursive solution for this???
wow. just wow
💡 DP PLAYLIST: ruclips.net/video/73r3KWiEvyk/видео.html
Hey man, just wanted to say thank you for putting the time in to make these videos! They've been super helpful and I was able to secure a google offer as a result :)
Congrats, You deserve it! I'm happy the videos were helpful.
Congrats man!
Probably the best explanation out of LeetCode discussions and RUclips Videos combined.
I love these visuals. Keep it up!
Thanks a lot for your channel. I've always hated doing leetcode but knowing that your solution videos exist makes life a lot easier.
Love the part that you said "what does the cache tell us? why do we have it"
Really inspiring and engaging video! Thank you!!
Best Explanation I have ever come across. Subscribed.
Hey dude. you explain things nicely. Let's do leetcode 2158 too if possible. Thanks
It really makes me wordless. Very amazing, can't speak more
Good explanation and elegant solution
Brilliant as always!
Would you consider this problem under 0/1 knapsack pattern?
You are a genius😭
Thanks neetcode
Thanks my friend, your videos are just amazing :)
@neetcode, shouldn't the brute force time complexity be 3^n ? It's 3 choices, n times.
No, it's 3 choices only for the first house. For the rest of the houses it's 2 choices to avoid the adjacent house
Hey man, first of all, thank you very much for making these! I just wanted to ask why is this algorithm correct? I can't wrap my brain around it
Hey buddy i watch all your videos can you clear .whether all dp problems can be memorized or not ??
What if the number of color also varies ? can we solve it in similar way ?
Dude you da man!
Awesome explanation. Even a dumb head like myself could understand
thanks
I solved this in codechef
can share link
please solve todays leetcode challenge. It is very tough . Please bro
Annyone has recursive solution for this???
wow. just wow