Code Room
CodingEasy
Question
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.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.