Best Time to Buy And Sell Stock With Cooldown

Problem

Given daily stock prices, find the maximum profit achievable from any number of buy/sell transactions, where after selling you must wait one full day (cooldown) before buying again, and you may hold at most one share at a time.

Examples

Example 1

Input:prices = [1,2,3,0,2]

Output:3

Buy, sell, cooldown, buy, sell.

Constraints

1 <= prices.length <= 5000

Solve it in the editor. Sign in free to run your Python or JavaScript against test cases, get a verdict, and track your attempts.

Solve on FeatCode →

How to approach it: the 2-D Dynamic Programming pattern

The same DP idea as 1-D, but the state depends on two indices — often two positions in a grid, or a position in each of two sequences being compared.

Look for this pattern when

You're comparing two sequences (finding a longest common subsequence, edit distance).
You're computing paths or optimal values across a 2-D grid.

Read the full 2-D Dynamic Programming guide →

Video walkthroughs

Original problem on LeetCode ↗