The Indivisibles

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

Domain

Python

Difficulty

easy

Seniority

L5

Problem

Given a positive integer n, return all prime numbers strictly less than n in ascending order. Return an empty list when n <= 2.

Summary

Numbers that yield only to themselves.

Practice This Problem

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