Whats wrong in my approach?

#1

Getting wrong output.

#2

hello @Prashant-Kumar-1947183015386369
image

use long long here image

also use modulo property to perform addition.
dp[i]=(dp[i-1]%mod + dp[i-2]%mod)%mod;

#3

Hi Aman, I have #defined int as long long

#4

PS : Even after modulo division it fails 2 test cases

#5
#6

handle when n==1 then ur dp size will be 2.and u will try to acccess index 2. which is wrong.
so handle this case separately .
i.e if n <=2 return n.

#7

Still 2 test cases show run error

#8

pls share ur updated code.
and problem link.

#9

https://online.codingblocks.com/app/player/42595/content/83730/5073/code-challenge

#10
#11

declare ur dp array as global array of constant size and then try.

#12

Now getting MLE in one tc

#13

ok ,so see dp[i] depends on previous two states only i.e dp[i-1] and dp[i-2].

so instead of using array use two variable to store previous 2 states.

#14

Now what is the problem? https://ide.codingblocks.com/s/247031

#15

image
use mod property here as well

#16

Thank you very much.