Count number of binary strings

#1

the code is returning wrong values instead of creating proper recursive calls

#2

Please send your code link.

#4

i hope this will suffice

#5

Your code is wrong. This have same recurrence as of fibonacci numbers, just inital two values are different.
f(1) = 2;
f(2) = 3;

otherwise f(n) = f(n-1) + f(n-2);

#6

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.