Code Room
CodingMedium
Question
A pricing tool shows, for each day in a price history, the best price still to come: the highest price on any strictly later day. Given the list of daily prices, return a list of the same length where position i holds that future maximum, and the last position holds -1 (no later days exist). Example: [3, 7, 1, 4] becomes [7, 4, 4, -1].
Implement
best_price_ahead(prices: list[int]) → list[int]Examples
in
[[3,7,1,4]]out[7,4,4,-1]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.