Running maximum prices
A price chart highlights record highs. Given a list of daily prices in chronological order, return a list of the same length where position i holds the highest price seen on any day up to and including day i. Example: [3, 1, 4, 2, 6] becomes [3, 3, 4, 4, 6].
Implement
record_highs(prices: list[int]) → list[int]Examples
in
[[3,1,4,2,6]]out[3,3,4,4,6]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 10 min
solution.py
InputExpectedGot
[[3,1,4,2,6]][3,3,4,4,6]not run yetsample