Maximum Stock Trading Profit with Unlimited Transactions

meta

You are given an integer array prices, where prices[i] is the price of a stock on day i.

You may complete as many transactions as you want. A transaction consists of one buy followed by one sel...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: