Count number of Binary Strings

#1

https://ide.geeksforgeeks.org/5f8YBizkYe

Why wrong answer?

#2

You are doing it wrong, please do see your approach once again.I am giving you a hint - It is similar to fibonacci recurrence.
F(n) = F(n-1) + F(n-2);

#3

I have used backtracking along with dp…

#4

Can you check my approach again?

#5

@Robin_rst Please tell

#6

For this test case your code is giving wrong output.
Testcase -:
1
89

Your output - 755204270
Correct Output - 4660046610375530309

#7

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.