Count number of binary strings

#1


i have written recursive solution.
anyone help me how to use memoization to optimize code

#2

what you are doing is coreect , but the thing is you are making the strings, you only have to count the strings, logic is correct!

#3

i have figured out dp solution. i am asking for how to implement memoization to optimize code ?
please help. i am unable to figure out.

#4


bottom up dp approach

#5


you code with memoisation , this is how we implement memoisation

#6

above memoised code not working.

#7

the ouput should be memo[0] not cnt,

#8

cout<<memo[0]<<endl;

give 0 for every test case.
still not working.

#9

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

1 Like