A easy Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

easy

Seniority

L3

Problem

Given an integer n > 1, return its prime factorization as a list of primes in ascending order. Repeated factors are included (for example, 12 -> [2, 2, 3]).

Summary

Every composite thing can be broken down to its simplest parts.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.