Code Typing · Python
Fibonacci (iterative)
Compute the nth Fibonacci number without recursion.
Difficulty: Beginner · 9 Lines · License: public-domain
def fibonacci(n):
if n < 2:
return n
a, b = 0, 1
for _ in range(n - 1):
a, b = b, a + b
return b
print([fibonacci(i) for i in range(10)])
Time0:00
Speed (WPM)0.0
Accuracy100.0%
Mistakes0
Live Keyboard
Next Key: D | Last Pressed: -
Progress: 0.0%
`
1
2
3
4
5
6
7
8
9
0
-
=
Q
W
E
R
T
Y
U
I
O
P
[
]
A
S
D
F
G
H
J
K
L
;
'
Z
X
C
V
B
N
M
,
.
/
Space
Timed Test Leaderboard
No results yet. Be the first to set a score.