Best Time to Buy and Sell Stock IV

Best Time to Buy and Sell Stock IV is a Hard Data Structures and Algorithms interview problem you can solve, run and submit on Thita.ai. It belongs to the Dynamic Programming (DP) Patterns pattern, in the Stock problems subpattern.

Problem statement

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

Find the maximum profit you can achieve. You may complete at most k transactions.

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

Example 1: Input: k = 2, prices = [2,4,1] Output: 2 Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.

Example 2: Input: k = 2, prices = [3,2,6,5,0,3] Output: 7 Explanation: Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4. Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.

Constraints: 0 <= k <= 100 0 <= prices.length <= 1000 0 <= prices[i] <= 1000

Topics and companies

Topics: Dynamic Programming.

Reported in interviews at Amazon, Google, Uber.

How to practise Best Time to Buy and Sell Stock IV on Thita.ai

Starter code is provided in C, C#, C++, dart, elixir, erlang, Go, Java, JavaScript, Kotlin, PHP, Python, python3, racket, Ruby, Rust, Scala, Swift and TypeScript. Your solution runs against 5 test cases for this problem, with the AI coach available for a hint when you are stuck rather than a finished answer. The reference solution runs in O(n) time and O(n) space.

Open Best Time to Buy and Sell Stock IV in the code editor, or read the Best Time to Buy and Sell Stock IV editorial for a worked solution with its approach and complexity analysis.

Where Best Time to Buy and Sell Stock IV sits in the DSA pattern sheet

Problems related to Best Time to Buy and Sell Stock IV

Other problems that use the same Stock problems and Dynamic Programming (DP) Patterns techniques:

Opening the problem

Progress is saved as you study.