Python BasicsEasy

Factor of a number

Detailed guide and Python implementation for the 'Factor of a number' problem.

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?
Consider using Basics-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

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

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.