309. Best Time to Buy and Sell Stock with Cooldown LeetCode Solution

In this guide, you will get 309. Best Time to Buy and Sell Stock with Cooldown LeetCode Solution with the best time and space complexity. The solution to Best Time to Buy and Sell Stock with Cooldown problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

1. Problem Statement
2. Complexity Analysis
3. Best Time to Buy and Sell Stock with Cooldown solution in C++
4. Best Time to Buy and Sell Stock with Cooldown solution in Java
5. Best Time to Buy and Sell Stock with Cooldown solution in Python
6. Additional Resources

Problem Statement of Best Time to Buy and Sell Stock with Cooldown

You are given an array prices where prices[i] is the price of a given stock on the ith day.
Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions:

After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day).

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

Example 1:

Input: prices = [1,2,3,0,2]
Output: 3
Explanation: transactions = [buy, sell, cooldown, buy, sell]

Example 2:

Input: prices = [1]
Output: 0

Constraints:

1 <= prices.length <= 5000
0 <= prices[i] <= 1000

Complexity Analysis

• Time Complexity: O(n)
• Space Complexity: O(1)

309. Best Time to Buy and Sell Stock with Cooldown LeetCode Solution in C++

class Solution {
 public:
  int maxProfit(vector<int>& prices) {
    int sell = 0;
    int hold = INT_MIN;
    int prev = 0;

    for (const int price : prices) {
      const int cache = sell;
      sell = max(sell, hold + price);
      hold = max(hold, prev - price);
      prev = cache;
    }

    return sell;
  }
};
/* code provided by PROGIEZ */

309. Best Time to Buy and Sell Stock with Cooldown LeetCode Solution in Java

class Solution {
  public int maxProfit(int[] prices) {
    int sell = 0;
    int hold = Integer.MIN_VALUE;
    int prev = 0;

    for (final int price : prices) {
      final int cache = sell;
      sell = Math.max(sell, hold + price);
      hold = Math.max(hold, prev - price);
      prev = cache;
    }

    return sell;
  }
}
// code provided by PROGIEZ

309. Best Time to Buy and Sell Stock with Cooldown LeetCode Solution in Python

class Solution:
  def maxProfit(self, prices: list[int]) -> int:
    sell = 0
    hold = -math.inf
    prev = 0

    for price in prices:
      cache = sell
      sell = max(sell, hold + price)
      hold = max(hold, prev - price)
      prev = cache

    return sell
 # code by PROGIEZ

Additional Resources

• Explore all LeetCode problem solutions at Progiez here
• Explore all problems on LeetCode website here

Happy Coding! Keep following PROGIEZ for more updates and solutions.