# Define a recursive function factorial(n) with a base case at n <= 1 returning 1, else return n * fac

Canonical URL: <https://datadriven.io/problems/define-a-recursive-function-factorialn-with-a-base-case-at-ba83040c>

Domain: Python · Difficulty: medium

## Problem

Define a recursive function factorial(n) with a base case at n <= 1 returning 1, else return n * factorial(n - 1). Print factorial(0), factorial(1), and factorial(6), each on its own line.

## Related

- [All practice problems](https://datadriven.io/problems)
- [Mock interview mode](https://datadriven.io/interview/define-a-recursive-function-factorialn-with-a-base-case-at-ba83040c)
- [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.