{"id":1013,"date":"2025-08-27T19:47:09","date_gmt":"2025-08-27T14:17:09","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=1013"},"modified":"2025-08-27T19:47:10","modified_gmt":"2025-08-27T14:17:10","slug":"best-time-to-buy-and-sell-stock-iv","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/best-time-to-buy-and-sell-stock-iv\/","title":{"rendered":"Best Time to Buy and Sell Stock IV | Leetcode 188 | Recursion to Tabulation Approach"},"content":{"rendered":"\n

You are given an integer k<\/code> and an array prices<\/code> where prices[i]<\/code> is the price of a stock on day i<\/code>. You may complete at most k<\/code> transactions in total. One transaction means one buy followed by one sell. You cannot hold multiple stocks at the same time, so you must sell before buying again.<\/p>\n\n\n\n

Return the maximum profit you can achieve 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>
k = 2, prices = [3, 2, 6, 5, 0, 3]<\/span><\/span>\nAnswer = 7<\/span><\/span>\nExplanation<\/span>:<\/span><\/span>\nBuy at 2, sell at 6  -> profit 4<\/span><\/span>\nBuy at 0, sell at 3  -> profit 3<\/span><\/span>\nTotal profit = 7<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
This problem generalizes \u201cBest Time to Buy and Sell Stock III\u201d from a fixed limit of 2 transactions to a variable limit k<\/code>. The core challenge is to choose which buy and sell pairs to execute so that the total profit is maximized while not exceeding k<\/code> completed transactions.<\/p>\n\n\n
\n\t\t\t
\n\t\t\t\t
Content:<\/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