Stock trading with cooldown
Given daily prices of a stock, you may complete as many buy/sell transactions as you like, but you can hold at most one share at a time and after you sell you must wait one full day (cooldown) before buying again. Return the maximum profit. The price list may be empty.
Implement
stock_with_cooldown(prices: list[int]) → intExamples
in
[[1,2,3,0,2]]out3What 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 25 min
solution.py
InputExpectedGot
[[1,2,3,0,2]]3not run yetsample