The Fibonacci series is a numerical series where each item is the sum of the two previous items. It starts off like this: 0,1,1,2,3,5,8,13,21... Is usually used in white board interview to know if the candidate has some knowledge about algorithm and The notation.
One of the obvios solotion to solve the Fibonacci series problem is to use recursion, but the problem this is to deal with the maximum call stack problem:
Any recursive function use a base case and a recursive case, in Fibonacci this works like this: