<p>You are given an integer array <code>prices</code> where <code>prices[i]</code> is the price of a given stock on the <code>i<sup>th</sup></code> day, and an integer <code>k</code>.</p>

<p>Find the maximum profit you can achieve. You may complete at most <code>k</code> transactions: i.e. you may buy at most <code>k</code> times and sell at most <code>k</code> times.</p>

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

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

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

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> k = 2, prices = [3,2,6,5,0,3]
<strong>Output:</strong> 7
<strong>Explanation:</strong> 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.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= 100</code></li>
	<li><code>1 &lt;= prices.length &lt;= 1000</code></li>
	<li><code>0 &lt;= prices[i] &lt;= 1000</code></li>
</ul>

class Solution:
    def maxProfit(self, k: int, prices: List[int]) -> int:
        memo = [[[-1] * 2 for _ in range(2 * (k + 1))] for _ in range(len(prices))]

        def dfs(pos, trans, hold):
            if not trans:
                return 0
            
            if len(prices) == pos:
                return 0
            
            if -1 != memo[pos][trans][hold]:
                return memo[pos][trans][hold]
            
            ret1 = 0
            if hold: # Sell it
                ret1 = prices[pos] + dfs(pos + 1, trans - 1, 0)
            else: # Buy it
                ret1 = dfs(pos + 1, trans - 1, 1) - prices[pos]
            
            # Hold current stock (if there are any)
            ret2 = dfs(pos + 1, trans, hold)

            memo[pos][trans][hold] = max(ret1, ret2)
            return max(ret1, ret2)
        
        return dfs(0, 2 * k, 0)
            
40318