Test case are not passing out

#1

I have applied correct logic for the question can you ease help me out in this

#2

hello @manikjindal49
pls share ur code using cb ide.

#3

My solution link :-https://ide.geeksforgeeks.org/jGR5IYTtk5

#4

@manikjindal49
image

a)
declare ur dp size of atleast n+2

b) apply mod in
dp[i]=(dp[i-1] + dp[i-2]) %mod;

the test case will still not pass becuase n is big .
try to do it in O(1) space .
hint -> this problem is same as calculating nth fibonnaci

#5

Itis not showing any space complexity error it is showing that your answer is wrong please help me out with that

#6

these changes are for removing wa only

#7

i have done that changes alrady which you asked for then only it is showing the error

#8

check now->

#9

Still getting MLE error on last testcase

#10

… . . . . . . . .

#11

It is not passing as now time compexity is become a proble

#12

@manikjindal49
if O(n) time and o(1) space solution is not passing then try matrix exponentiation.