Only one test case passes, others give tle

#1

here is the link to my code:

#2

hello @prerna_gupta31 in this quesiton you have to apply the concept of dynamic programming .
you cannot only do this by recursive with modulo .
if you think how i am saying that you have to apply DP this is because the test cases in this question are very large .
i hope i have cleared your doubt
if you still have any query please reply here,we will discuss otherwise please mark this as resolved .
Happy Learning !!

#3

Hey @prerna_gupta31
@tusharaggarwal272 already told you
So how can I help you?

#4

This question is given in the recursion section… so is there any way to solve this with recursion?

#5

@prerna_gupta31 in recursion section there must be the question tilling problem 1 which you will be able to solve by recursion only , as the test case are not very large in that .
but in tilling problem 2 test cases are large that is why it demands the more optimized approach which can be done by using recursion .
i hope i have cleared your doubt .
Happy Learning !!

1 Like
#6

@prerna_gupta31
Is your doubt resolved ?

#7

But tilling problem is in recursion section

#8

Hey @nikhiv6

…

#9

Got your point, but here tiling problem 2 is showing up in recursion challenges section

#10

Exactly! there is no tiling problem - I in Recursion section, neither in DP section

1 Like
#11

Hey @nikhiv6 @prerna_gupta31
Skip this question I will get it rectified.
Also, I just checked no tilling problem -I exist , so maybe they put this problem in this sectiion by mistake .

1 Like