Count Ways To Build Good Strings - Leetcode 2466 - Python

0:00 - Intro
1:30 - Read the problem
2:00 - Drawing Explanation
6:35 - Coding Recursive
12:18 - Coding Bottom Up

leetcode 2466

#neetcode #leetcode #python

[myyfstz]

thanks boss, 100% should be reuploaded. People need this.

[adilansari-hqge]

Any Video which has been recored 2 years back, you must re-record and reupload . The Reason, Your teacing style has improved a lot in past years.
When I watch old videos, i find new videos are much much better.
Please increase the font size of Code Editor.
Love you bro, Keep recording and teaching.

[ceciljoel]

I leanrnt dynammic programming thanks to you your teaching is exceptional

[SarweshParsewar]

Would really appreciate if you start posting contest solutions for problem 3 and 4 coz they are unique sometimes

[n-logn]

Thanks neetcode, I am currently following neetcode 150 and i was able to solve this question on my own after solving n150's dp section.

[EranM]

just one thing in 15:15, you don't need the list comprehension brackets, you can just use the sum() brackets which calculates it as a generated object

[prajwals]

Wow to think there was a time NC did not use defaultdicts

[chaitanyayeole]

Do not reupload if there is no better solution or explaination, but if you have a better approach to the same solution, please upload a new video.
You can post an YouTube story or post to the link of the video.

[tejuju]

Agree for me to upload again repetitive questions, as the most actual ones have translation to my language :) thx

[VanjeAv]

The upload is cool with a small intro thanks

[teccs]

The re-uploaded video is fine but is it not missing the time and space complexity that you typically do at the end of the video? I find Big O analysis hard when the problem doesn't easily map onto something I am familiar with so having this to build more intuition on top of would be very helpful.

I would say only reupload if the video contains the base necessities that are present in all of your recent videos, primarily:

1. explanation & problem reading
2. implementation
3. "coding it up"
4. retrospection and complexity analysis

Thank you for all of your videos and insight, they are tremendously helpful.

[Hoppitot]

Bruh I basically cleared 80% of neetcode 150 and now we get the less painful version hahaha

[e_sumit]

before seen your face, i thought there is a foreigner behind the screen :D, nice to see you.

[jnic]

I like when you upload because I see it straight away in my recommended, but if its a bit of a hassle to reupload, then it's totally unnecessary to do this. Also I would love to see recent weekly contest questions solved by you. I feel that some of the questions can be quite interesting and worth an upload.

[quaiwentt]

why doesn't it work to do the modulo to the answer after computing the entire answer? like return dfs(0) % (10 ** 9 + 7)? I tried it that way and got memory limit exceeded. why do you have to mod it inside the dfs function?

[PedanticAnswerSeeker]

Please do a redo of it though. I want to see a fresh take please

[Nonsense]

I like your new speaking cadence a lot more

[DebopriyoBasu]

Hey Neetcode, is there any Purchasing Power Parity provided for low income countries while purchasing Neetcode Pro?

[Tobi-ry]

How much time did it took to come up with a solution like this.

[antm]

I don't understand why dp = {0: 1}. Does this mean that there is 1 way to get an empty string from a string of length zero and a string of length one? According to the condition, zero > 0 and one > 0. What is this one way? Is it the way of 'NOT TAKING zero and NOT TAKING one'? Or what? I don't understand how to handle the base case.