Coolest temperature stretch
A server-room dashboard scans hourly temperature readings for the coolest stretch of the day. Given the readings temps (non-empty, may include negatives) and a stretch length k (1 <= k <= number of readings), return the minimum possible sum of k consecutive readings. Keep a running window sum rather than recomputing each stretch. Example: temps = [30, 25, 27, 31, 24, 26], k = 2 gives 50 (24 + 26).
Implement
coolest_stretch_sum(temps: list[int], k: int) → intExamples
in
[[30,25,27,31,24,26],2]out50What 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
[[30,25,27,31,24,26],2]50not run yetsample