Stock trading k transactions
Given daily prices and an integer k, find the maximum profit with at most k transactions (a transaction is a buy followed by a later sell). You may not engage in multiple transactions simultaneously. Constraints: 0 <= k <= 100, 0 <= n <= 1000, 0 <= price <= 1000.
Implement
max_profit_k(k: int, prices: list[int]) → intExamples
in
[2,[2,4,1,7]]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 35 min
solution.py
InputExpectedGot
[2,[2,4,1,7]]8not run yetsample