The Indivisibles
A easy Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- easy
- Seniority
- L5
Interview Prompt
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.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision