What is the optimal time complexity of solving Factorial of a number?

The optimized solution achieves a time complexity of O(n) by using sorting, mathematical shortcuts, or hash table lookups.

What is the auxiliary space complexity for Factorial of a number?

The space complexity is O(1) since we only use a minimal/constant amount of extra memory for tracking variables (or auxiliary space if dynamic structures are allocated).

What are the typical edge cases we must handle in Factorial of a number?

Key edge cases include empty collections, negative or large bounds causing integer overflow, arrays with only one element, or inputs where target criteria are not met.

How can we optimize the brute force approach for Factorial of a number?

Brute force methods often inspect all possible combinations. We optimize this by sorting the input list to enable binary search, or tracking processed items in a set to avoid redundant nested loop lookups.

Back to Practice Dashboard

Python BasicsEasy

Factorial of a number

Learn how to solve the 'Factorial of a number' problem. This detailed resource details brute force and optimized approaches.

Mode Selected

Problem Statement

Easy

Write a function factorial(n) that takes a non-negative integer n and returns its factorial. The factorial of n (written as n!) is the product 1 × 2 × 3 × ... × n. By definition, 0! = 1.

Constraints

•0 <= n <= 20

Examples

Example 1

Input

n = 5

Output

Explanation

5! = 1 × 2 × 3 × 4 × 5 = 120.

Example 2

Input

n = 0

Output

Explanation

0! is defined as 1.

Example 3

Input

n = 10

Output

Explanation

10! = 3628800.

Need a Hint?

Use simple arithmetic operators (like modulo `%`, division `//`), conditional checks, or loops to inspect number properties.

Edge Cases to Watch

Empty list or null input variables
Single item lists/arrays
Extremely large input bounds causing integer or stack overflow

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor