Write a function to generate the nth Fibonacci number.
The nth Fibonacci number is given by:
Fn = Fn-1 + Fn-2
The first two terms of the series are 0 and 1.
Hence, the series is: 0, 1, 1, 2, 3, 5, 8, 13...
Use Cmd instead of Ctrl if you're on a Mac.
| g | Focus editor |
| Ctrl-Enter | Run the test with current code |
| Ctrl-Shift-K | Reset the editor |
| Ctrl-Shift-L | Clear console output |
| Ctrl-Shift-X | Show the solution |
| [ | Previous challenge |
| ] | Next challenge |
| T | Back to top page |
| ? | Show this dialog |
| ESC | Hide this dialog |
| Shift-ESC | Blur focus from editor |