We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Its giving a runtime error because most probably, the recursive calls are too much even for even a much smaller value of 'n' like 40 or 50. Hence, at runtime, the stack will get fully occupied (i.e., Stack Overflow) which results in inability of the function to call itself again.
From my point of view, i think this the problem.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Fibonacci Modified
You are viewing a single comment's thread. Return to all comments →
Its giving a runtime error because most probably, the recursive calls are too much even for even a much smaller value of 'n' like 40 or 50. Hence, at runtime, the stack will get fully occupied (i.e., Stack Overflow) which results in inability of the function to call itself again. From my point of view, i think this the problem.