Not getting this question class assignment

#1

I think I didn’t get the logic of this problem. Kindly help with it. I’m using fibonnaci number as it appears to me it should work.

#2

@ritwika94kashyap hey rittika this kinda similar approach is used in this challenge
the sample one is given like
test case =3
n=1
n=2
n=3
make a function n_digits and pass the value of n in the function
inside the function declare two array inside the function int a[n],int b[n]
and mark index 0 of both the array is 1
like
a[0]=1;
b[0]=1;
now apply a loop from i=1 to upto <=n
and do
a[i]=a[i-1]+b[i-1];
b[i]=a[i-1];
and return
a[n-1]+b[n-1];
do dry run on this logic