Coolest temperature stretch

Write codeEasy10 min

Your task

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).

Examples

coolest_stretch_sum(temps: list[int], k: int) -> int
Example 1
Inputcoolest_stretch_sum([30, 25, 27, 31, 24, 26], 2)
Output50