CodingMediumcod-g1185

Subject ArraysLevel Entry–Mid~15 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

A reseller watches one collectible's price each day and may buy on one day and sell on any strictly later day, at most once. Given the price history, return the largest profit possible, or 0 if no profitable buy-sell pair of days exists. Example: [7, 1, 5, 3, 6, 4] yields 5 (buy at 1, sell at 6).

Implement

best_flip_profit(prices: list[int]) → int

Examples

in[[7,1,5,3,6,4]]out5

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.