110. Best Time to Buy and Sell Stock III
HardDynamic Programming
You are given an array prices where prices[i] is the price of a given stock on the ith day. Find the maximum profit you can achieve. You may complete at most two transactions. Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
Examples
Input: [3,3,5,0,0,3,1,4]
Output: 6
Explanation: Two transactions (+3 and +3) give 6.
Constraints
- 1 <= prices.length <= 10^5
- 0 <= prices[i] <= 10^5
Loading...
Run checks all cases above. Submit evaluates all test cases.