Hi Karan, I used iteration to solve the problem instead of using recursion. I think it gives better performance. It's only O(n). Thank you for your time.

In fibonacci series, next number is the sum of previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 etc. The first two numbers of fibonacci series are ...