Back to Practice Dashboard
Python BasicsEasy
Factor of a number
Learn how to solve the 'Factor of a number' problem. This detailed resource details brute force and optimized approaches.
Problem Statement
Easy
Write a function find_factors(n) that takes a positive integer n and returns a list of all factors (divisors) of n in ascending order. A factor of n is any positive integer that divides n without leaving a remainder.
Constraints
- •1 <= n <= 10^6
Examples
Example 1
Input
n = 12
Output
[1, 2, 3, 4, 6, 12]
Explanation
12 is divisible by 1, 2, 3, 4, 6, and 12.
Example 2
Input
n = 7
Output
[1, 7]
Explanation
7 is prime, so its only factors are 1 and 7.
Example 3
Input
n = 1
Output
[1]
Explanation
The only factor of 1 is 1 itself.
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.