Tilling Problem - 2

#1


plz check my code, logic!!!

#2

hello @Bhavya_Goel
why u are considering m as a state. it will be always constant for a given test case.
use 1d dp.
with recurremce relation.
ways(n)=ways(n-1)+ways(n-m)

also use modulo property .
i.e (a+b)%mod=(a%mod+b%mod)%mod;

#3

im not getting it😅 please could you provide me code of the same or edit it in my code

#4

check this-> https://ide.codingblocks.com/s/229559