Hey! I have tried the BU Implementation for this problem, but my test cases are not passing, plz check
Count Number of Binary Strings
chal gya, but long long int kyu jarurat padi,? testcase mai constraints toh itne bade nhi thay
numbers of ways integer ki range se jayda ho sakte hai isliye
ok, so long long int actual mai kaha use krna tha, maine sab jagah laga dia, n mai krna tha ya dp mai
dp array mein aur function ke return type mein.
plz help me in building algo for recursive approach
base case should be if n==0 return 1;
otherwise
usual recursion according to last_bit.
yes im facing problem in that recurrence reln only