Stock trading k transactions
Given an integer k and daily prices, find the maximum profit with at most k completed transactions, holding at most one share at a time. k can be 0 and can exceed the number of days. The price list may be empty.
Implement
stock_k_transactions(k: int, prices: list[int]) → intExamples
in
[2,[2,4,1]]out2What 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 30 min
solution.py
InputExpectedGot
[2,[2,4,1]]2not run yetsample