Unbroken

An easy Python mock interview question on DataDriven, with an AI interviewer who asks follow-up questions and a hire or no-hire decision at the end.

Domain
Python
Difficulty
easy
Seniority
junior

Interview Prompt

A linac logs a dose reading each cycle, and instability shows up as a drop from one cycle to the next. Given `readings` in order, return the length of the longest unbroken stretch with no drop.

Summary

A single dip resets the clock. Find the longest the machine held steady.

How This Interview Works

  1. Read the vague prompt (just like a real interview)
  2. Ask clarifying questions to the AI interviewer
  3. Write and run your Python against test cases
  4. Answer the interviewer's follow-up questions, then get a hire or no-hire decision