Decode Ways | Leetcode | Algorithm Explanation By alGOds

preview_player
Показать описание
In this video, Vikas has explained the optimized approach for solving the question #DecodeWays from #Leetcode in O(n) time complexity.

Feel free to ask any of your doubts and discuss your attempts related to this question in the comments section 😇.

Do like and subscribe to our channel and click the bell icon so you don’t miss any future videos!!.
Don’t forget to tell us about the Questions you need an explanatory video for in the comments section. We’ll definitely take care of it😁.

The contributors to this channel and their profile links are enlisted below

1) Vishesh Aggarwal:
2) Vaibhav Varshney:
3) Vagish Yagnik:
4) Vishesh Jain:
5) Achint Dawra:
6) V Sriram:
7) Varun Bajlotra:
8) Vikas Yadav:
Рекомендации по теме
Комментарии
Автор

Thanks! you finally made me understand why dp[i] = dp[i - 1] + dp[i -2] when taking 2 digits and dp[i] = dp[i -1] when only taking one.

josuebrizuela
Автор

Thanks!! This is the only video i found that cleared my concept.

apoorvajain
Автор

What will happen when there is zero(s) in middle like 123404321 ??

PankajKP
Автор

Beautiful explanation. The best so far. Thank you for sharing this.

darshansimha
Автор

content is good, but one suggestion, just use some more goodlooking thumbnails for your videos.

bunnyrabits
welcome to shbcf.ru