Moving average
Given a stream of integer readings and a window size k, compute the moving average over each contiguous window of exactly k readings, in order. Return a list of floats: the average of readings[0..k-1], readings[1..k], and so on. If the stream has fewer than k readings, return an empty list. Use an O(n) running-sum approach. Assume k >= 1.
Implement
moving_average(readings: list[int], k: int) → list[float]Examples
in
[[1,2,3,4],2]out[1.5,2.5,3.5]What 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 30 min
solution.py
InputExpectedGot
[[1,2,3,4],2][1.5,2.5,3.5]not run yetsample