Best time buy sell stock
Given daily prices, return the maximum profit from a single buy-then-sell. Return 0 if no profit is possible.
Implement
max_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