Test cases not run

#1

works for sample tests
check logic

#2

can you please share your code?
By the way, I can help you with approach:
say f(n) is no of n digit integers.
then f(n) can be recursively written as f(n) = f(n-1) + f(n-2) , n>2
f(1) = 2, f(2) = 3
how? think about it.
f(n) = all integers with first digit a + all integers with first digit b(second digit must be a)
f(n-1) + f(n-2)

thanks