Write a recursive function factorial(n) that returns n
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
Write a recursive function factorial(n) that returns n! (n * factorial(n-1), base case: factorial(0) = 1). Print factorial(5) and factorial(0).
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision