Maximize profit with unlimited transactions
Given daily prices, return the maximum profit when you may buy and sell as many times as you like (one share at a time).
Implement
max_profit_ii(prices: list[int]) → intExamples
in
[[7,1,5,3,6,4]]out7What 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]]7not run yetsample