Loading...
The Indivisibles
A easy Python interview practice problem on DataDriven. Write and execute real python code with instant grading.
- Domain
- Python
- Difficulty
- easy
- Seniority
- senior
Problem
Our cryptographic key generator needs a fast prime lookup table. Write a function called primes_below that takes a positive integer n and returns all prime numbers less than n in ascending order.
Practice This Problem
Solve this Python problem with real code execution. DataDriven runs your Python code in a sandboxed Docker environment and grades it instantly.