DataDriven
LearnPracticeInterviewDiscussDailyJobs

Implement memoized Fibonacci using a dictionary cache

A medium Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.

Domain
Python
Difficulty
medium

Interview Prompt

Implement memoized Fibonacci using a dictionary cache. Define fib(n) that checks the cache before computing. Print fib(10) and fib(20).

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

Related

  • All Mock Interviews
  • Practice Mode (untimed)
  • Python Interview Questions
  • Data Engineering Interview Prep Guide
  • Practice Problems
  • Daily Challenge