Decode Ways II | Leetcode 639 | Live coding session

preview_player
Показать описание
Here is the solution to "Decode Ways II" leetcode question. Hope you have a great time going through it.

Chapters
1) 0:00 Explaining the problem out loud
2) 1:10 Question walkthrough
3) 2:30 Algorithm in O(n) solution
5) 12:00 Coding it up

For discussion/feedback

PS : Please increase the speed to 1.25X
Рекомендации по теме
Комментарии
Автор

Finally got the whole in depth understanding of problem after staying at it for a very long time.

amazinglife
Автор

using switch to get rid of multiple if else, all doubts cleared. thank you for the explanation.

RahulSingh-zemk
Автор

Great explanation. That table was helpful.. Finally, I solved the question :) Thanks!

sbond_
Автор

Sir, have you made a video on Decode way-i. If yes, please share a link of that video. otherwise please make a video on it.

_yatinnagpal
Автор

you have not counted *7, *8, *9 case? what about them? then the factor is 1*dp[i-1].

siddhantmodi
Автор

I am getting memory limit. Exceeded in python

bugresolver
Автор

I haven't checked your code but from explanation, it looks like case "*0" will return the wrong answer, ideally, its answer should be 2.

anujchauhan