Question
A monitoring dashboard stores a service's health-check history as a list of 0s and 1s, one entry per minute: 1 means the check passed, 0 means it failed. The reliability badge shows the longest unbroken run of passing checks in the window. Given the history list, return the length of that longest run of consecutive 1s. Return 0 for an empty list or a window with no passing checks. For example, [1, 1, 0, 1, 1, 1] returns 3.
longest_passing_run(checks: list[int]) → int[[1,1,0,1,1,1]]out3[[0,0]]out0State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.