Tap here to switch tabs
Problem
Submissions

Problem: Best Time to Buy and Sell Stock III

Best Time to Buy and Sell Stock III asks you to find the maximum profit from a price array using at most two completed buy-then-sell transactions, with one stock held at a time.

Statement

You are given an array, prices, where prices[i] represents the stock price on day ii.

Determine the maximum profit you can achieve by making at most two transactions. Each transaction consists of a single buy followed by a single sell.

Note: Each transaction must be completed before starting another, i.e, you must sell the stock before making a new purchase, and only one stock can be held at any time.

Constraints:

  • 1≤1 \leq prices.length ≤105\leq 10^5

  • 0≤0 \leq prices[i] ≤105\leq 10^5

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Best Time to Buy and Sell Stock III

Best Time to Buy and Sell Stock III asks you to find the maximum profit from a price array using at most two completed buy-then-sell transactions, with one stock held at a time.

Statement

You are given an array, prices, where prices[i] represents the stock price on day ii.

Determine the maximum profit you can achieve by making at most two transactions. Each transaction consists of a single buy followed by a single sell.

Note: Each transaction must be completed before starting another, i.e, you must sell the stock before making a new purchase, and only one stock can be held at any time.

Constraints:

  • 1≤1 \leq prices.length ≤105\leq 10^5

  • 0≤0 \leq prices[i] ≤105\leq 10^5