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

A medium Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.

Domain

Python

Difficulty

medium

Interview Prompt

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.

How This Interview Works

1. Read the vague prompt (just like a real interview)
2. Ask clarifying questions to the AI interviewer
3. Write your python solution with real code execution
4. Get instant feedback and a hire/no-hire decision