Leetcode Decode Ways || Intuition + Code + Explanation

[@vishnuvardhanreddy4841]

Mam thank you so much your dp lectures are better than many paid courses. U r explanation is so simple and easy to understand 😊😊

[@vishnuvardhanreddy4841]

Please don't stop making lectures😊

[@VinodMuda]

Nice explanation! Thank you. Modified your code(Java) for constant space: class Solution { public int numDecodings(String s) { if(s.isEmpty() || s.charAt(0) == '0') return 0; int twoStepsBack = 1; int oneStepsBack = 1; for(int i = 2; i = '0' && currentChar

[@SHANMUKHASHARMA-s6h]

Very Well Explained Thank you very much

[@keerthana1216]

Clear explanation,thank you. Also your videos are very crisp and clear ,please make more vidoes,finding quite helpful.

[@AbdulRehman-ui3nj]

I paused the video at 18:39 to subscribe your channel, thanks for the easy explanation

[@nivedithabaskaran1669]

This was such a clear explanation video. Thank you!

[@Rajuraju-y9o3r]

Good explanation with different cases

[@TheElevatedGuy]

Clear & Nice explanation! Thank you very much ma'am!

[@dhruvgoel25]

Nice explanation 👍

[@shashankpal8888]

Hey, Can you make a video, how your coding journey start? Where to start? Which platform to do first?

[@himanshupandey9303]

There was a movavi editor plus banner which flashed in intervals in the video.

[@biswajitsaha6773]

Great explanation ma'am, but I think there is a small mistake in it, we can decode "110" in 1 way only (1,10), not 2 ways [21:30] 1,1,0 is not a valid decoding

[@pankajchadda1780]

Awesome explanation 😁 Thank you..

[@sakshamgupta304]

Hi @code with Alisha, it was such a nice explanation, you efforts were visible in video. However there was a cut in video when you just started tabulation part and then suddenly you lowered your voice, was that because you were recording at night ?. haha 😁, if that was so, that was such a cute moment 🤣.

[@smile8510]

awesome explanantion just solved it after getting the intuition

[@095udaykiran6]

Nice Explaination ,Thank You mam 🙏

[@heenamittal8621]

Excellent Explaination !! Thanks !:)

[@Asmithaayyanath]

very useful... thank you

[@vikaspeddinti52]

great explanation thanks 😊

[@bikkichoudhary8565]

Bahut mast samjhate ho aap didi😃

[@pranjalshinde1586]

getting memory limit exceeded while using recursion + memoization

[@josephcs1235]

Great video

[@beinghappy9223]

Amazing explanation didi

[@lalitagarwal9155]

Ma'am please tell that can I solve this question using BFS or not? I write a code myself using queue for BFS but that's running only for few cases so please tell..

[@aakashgoswami2356]

why you have taken previous two state i.e dp[i] += dp[i-2] . why dp[i-2] ? And why you have take dp[0] = 1;

[@raj_kundalia]

You mentioned that you'd tell about why dp[0] = 1. Could you explain that, please?

[@tanusharma0801]

In simpler terms, when you have an empty string (length 0), there is exactly one way to decode it, and that is by doing nothing. So, dp[0] is set to 1 to represent this one way.

[@shivanshgupta1509]

ThankYou mam!!!

[@vishalagarwal9392]

except striver , no youtuber can write recursive solution by themselves

[@imsubratabiswas]

why are you thinkinng like this man ??? 😂😂

[@barathnatarajan8566]

Thank you

[@jayasatwik1046]

class Solution { public: int numDecodings(string s) { int i,n=s.length(); if(s.length()==0||s[0]=='0') return 0; vectordp(n+1,0); dp[0]=1; dp[1]=1; for(i=2;i='1'&&s[i-1]='0'&&s[i-1]

[@HaiderAli-bq8hf]

put 6 in place of 9

[@malkeetsapien4852]

🙌🏻

[@ramashishrural]

Great work 👏 check your LinkedIn request 👏

[@shyren_more]

great explanation, thanks