Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Fibonacci Number > Editorial

Fibonacci Number — Solution & Editorial

Back to the Problem

Iterate with two variables — O(n), no recursion needed (naive recursion is exponential and will TLE conceptually, though n ≤ 80 mainly punishes 32-bit overflow). Use 64-bit integers in C/C++/Java; Python is unbounded.

a, b = 0, 1
for _ in range(int(input())):
    a, b = b, a + b
print(a)