(n)
| 1 | # Fibonacci Series using Dynamic Programming |
| 2 | def fibonacci(n): |
| 3 | |
| 4 | # Taking 1st two fibonacci numbers as 0 and 1 |
| 5 | f = [0, 1] |
| 6 | |
| 7 | |
| 8 | for i in range(2, n+1): |
| 9 | f.append(f[i-1] + f[i-2]) |
| 10 | return f[n] |
| 11 | |
| 12 | #driverCode |
| 13 | if __name__ == "__main__": |
no test coverage detected