Smooth traffic counts
Hourly foot-traffic counts for a store need light smoothing before display: each hour should show the busiest count among itself and its immediate neighbours. Interior hours look at three values; the first and last hours have only one neighbour and look at two. Given the counts in hour order, return the smoothed list. Example: [1, 5, 2, 2] becomes [5, 5, 5, 2].
Implement
smooth_counts(counts: list[int]) → list[int]Examples
in
[[1,5,2,2]]out[5,5,5,2]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 14 min
solution.py
InputExpectedGot
[[1,5,2,2]][5,5,5,2]not run yetsample