Not able to implement recursion in binary strings

#1


do we have to extract the last bit and what is the input format??

#2

hello @rastogi.g1998
your base case is wrong.

for n=1 answer should be 2 ( either 1 or 0 , both are correct)

if u are putting 0 for n==0 ,then u need to add more base case i,e if n==2 then return 3. (00,01,10)
rest evrthing is correct.

i cant tell u input format , as i dont have problem link .
if u have the pls check it input section for input format

#3

its (count binary strings of length of N,which have NO consecutive ones ?

#4

it is not an exercise its just conceptual video with a hint and this much only

#5

check ur dp assignment, this question might be mentioned there.

#6

i am currently doing recursion

#7

no issue, for input format u can refer that

#8

thank you sir i understood if n==1 it can either be 1 or 0 so return 2,if n==0,we already have 0 so return 0

#9

thank you sir i was trying to think with other codes perspective forgetting about this aspect thank you