Stock trading with fee
Given daily prices and a fixed transaction fee charged once per completed sell, find the maximum profit with unlimited transactions and at most one share held at a time. The fee is a non-negative integer. The price list may be empty.
Implement
stock_with_fee(prices: list[int], fee: int) → intExamples
in
[[1,3,2,8,4,9],2]out8What 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 20 min
solution.py
InputExpectedGot
[[1,3,2,8,4,9],2]8not run yetsample