# Write a recursive function factorial(n) that returns n

Canonical URL: <https://datadriven.io/problems/write-a-recursive-function-factorialn-that-returns-n-n-0c040ac3>

Domain: Python · Difficulty: medium

## Problem

Write a recursive function factorial(n) that returns n! (n * factorial(n-1), base case: factorial(0) = 1). Print factorial(5) and factorial(0).

## Related

- [All practice problems](https://datadriven.io/problems)
- [Mock interview mode](https://datadriven.io/interview/write-a-recursive-function-factorialn-that-returns-n-n-0c040ac3)
- [Python Interview Questions](https://datadriven.io/python-interview-questions)
- [Data Engineering Interview Prep Guide](https://datadriven.io/data-engineer-interview-prep)
- [Daily Challenge](https://datadriven.io/daily)

---

Source: DataDriven (https://datadriven.io). 100% free data engineering interview prep. Live code execution against Postgres 16, Python 3.11, and Spark sandboxes. No paywall, no premium tier, no signup gate.