Factorial Using Recursion | Dataford Interview Questions

How would you implement recursion to compute the factorial of a number, and how would you optimize it?

Implement factorial(n) to return n! using recursion. Optimize repeated calls by caching previously computed results. The input is a non-negative integer, and the output is an integer.

Function

def factorial(n):

Constraints

0 <= n <= 900
n is an integer
Return the exact integer value of n!

Function Signature

def factorial(n):

Your question is Factorial Using Recursion. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem