Python Recursion Quiz

This Python recursion quiz asks you to trace recursive functions, count calls and find the bugs that break them. It is good practice for coding interviews, with questions on base cases, RecursionError and the cost of naive recursion.

Hard 10 questions ~8 minutes Pass at 80% Python 3.12

Choose a mode

Playing as a guest: sign in to keep your XP and streak.

Sample question

Question 1 of 10

What does this print?

def fact(n):
    if n <= 1:
        return 1
    return n * fact(n - 1)

print(fact(5))
Show the answer

A. 120 fact(5) is 5 * 4 * 3 * 2 * 1. The base case stops at 1, so the chain of calls multiplies back up to 120.

What this quiz covers

  • Base case and recursive case
  • The order of work before and after a recursive call
  • RecursionError and the recursion limit
  • How many calls naive Fibonacci makes
  • Common bugs like a missing return or a shared default list

Questions people ask

Do I need an account?

No. Anyone can play. Sign in to keep your XP, streak, badges and history.

Which Python version?

Python 3.12. Every question about output was checked by running the code.

Can I retake it?

Yes. Your best score is kept, and the questions and answers are shuffled each time.