Count Number Of binary strings

#1

Can we solve this problem using dynamic programming?

#2

hi @Sfo_2302 it can be solved using DP
the rec relation will be
f(n) = f(n-1) + f(n-2)
base case:
f(1) = 2
f(2) = 3

#3

not getting the right answer

#4

@Sfo_2302 please share your code using CB IDE

#5

not getting the right answer the

#6

please see carefully that i have send the link already when i asked the doubt.

#7


Please refer to this link.