โ† All coding problems

Factorial

EasyRecursion

Return n! for 0 <= n <= 15 (0! = 1).

Function
function solve(n)
Example 1
n = 5
โ†’ 120

Submit also runs 3 hidden tests, including edge cases.

console.log output is shown below