{"id":1010,"date":"2025-08-27T19:35:39","date_gmt":"2025-08-27T14:05:39","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=1010"},"modified":"2025-08-27T19:35:40","modified_gmt":"2025-08-27T14:05:40","slug":"best-time-to-buy-and-sell-stock-iii","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/best-time-to-buy-and-sell-stock-iii\/","title":{"rendered":"Best Time to Buy and Sell Stock III | Leetcode 123 | Dynamic Programming Solution"},"content":{"rendered":"\n

You are given an array prices<\/code> where prices[i]<\/code> is the price of a stock on day i<\/code>. You are allowed to complete at most two<\/strong> transactions in total. One transaction means one buy followed by one sell. You cannot hold more than one stock at a time, which means you must sell the stock before you buy again.<\/p>\n\n\n\n

Your task is to return the maximum profit<\/strong> you can make under these rules.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

Example<\/strong><\/p>\n\n\n\n

<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
prices = [3,3,5,0,0,3,1,4]<\/span><\/span>\nAnswer = 6<\/span><\/span>\nExplanation<\/span>: <\/span><\/span>\nBuy at 3, sell at 5 (profit 2), then buy at 1, sell at 4 (profit 3).<\/span> <\/span><\/span>\nAn even better sequence is buy at 0, sell at 3 (profit 3) and buy at 1, sell at 4 (profit 3). Total 6.<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
The challenge is choosing the best two non-overlapping buy and sell pairs. This is harder than the unlimited transactions version because we must respect the limit of two transactions overall.<\/p>\n\n\n
\n\t\t\t
\n\t\t\t\t
Contents:<\/div>\n\t\t\t\t
\n\t\t\t
\n\t\t\t\u00a0[show<\/a>]\n\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/div>
\n\t\t\t
\n\t\t\t\t