← Divide & Conquer

Micro-Drill #80 — Fibonacci iterative

Divide & Conquer Target: 10s

Iterative Fibonacci is O(n) time, O(1) space. Classic DP introduction pattern.

a, b = 0, 1
for _ in range(n):
    a, b = b, a + b
# a is fib(n)

Type it from memory. Go.

Practice Problems

Related Coding Drills

← Micro #79 Micro #81 →