Loading interview...

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
senior

Interview Prompt

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.

How This Interview Works

  1. Read the vague prompt (just like a real interview)
  2. Ask clarifying questions to the AI interviewer
  3. Write your python solution with real code execution
  4. Get instant feedback and a hire/no-hire decision