Practice
JavaScriptData StructuresReactConcepts
Sign in
← Back to problems

Factorial

Recursion & Backtrackingeasy

Implement `factorial(n)` returning `n!` for a non-negative integer `n`, using recursion.

Sample tests

Input: factorial(5)
Output: 120
Input: factorial(0)
Output: 1

+ 1 hidden test run on Submit.

Hints

Common pitfalls
  • No base case overflows the stack.

Learning resources

  • Wikipedia: Backtracking
Approach & explanation (try first)

Straightforward recursion in O(n) time.

Loading...
⌘/Ctrl + Enter

Run your code to see results.