The Additive Chain
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
- L3
Interview Prompt
Given non-negative integer n, return the first n Fibonacci numbers starting with 0, 1, 1, 2, 3, 5, ... Use iteration, not recursion. Return [] when n = 0.
Summary
Each value is the sum of the two before it - no calls to itself allowed.
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