Binary string unable to undertand this concept of counting the non consecutive one

#1

unable to undertand this concept of counting the non consecutive one

#2

Hey @guptarahul3100
So basically we need to find the count of binary strings such that 1s are not together in it
for eg. for n=3 101 001 100 010 000 are Binary strings of lth 3 which follow that .
Check this :Queation samaj nhi aaya

#3

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.