Best buy-sell profit
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]) → intExamples
in
[[7,1,5,3,6,4]]out5What 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 15 min
solution.py
InputExpectedGot
[[7,1,5,3,6,4]]5not run yetsample