Longest passing streak
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.
Implement
longest_passing_run(checks: list[int]) → intExamples
in
[[1,1,0,1,1,1]]out3in
[[0,0]]out0What a strong answer looks like
State 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.
0:00 of about 10 min
solution.py
InputExpectedGot
[[1,1,0,1,1,1]]3not run yetsample[[0,0]]0not run yetsample