This number is actually the Fibonacci sequence of n+2, but when I am implementing fibo code it is showing the wrong answer for two test cases, How is it possible??
Count Number of Binary Strings
I think the series is not fibinacci for greater n. You need to implement recursive+dp solution.
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.