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

Find the maximum profit you can achieve by completing as many transactions as you like.

Note:
You cannot engage in multiple transactions simultaneously, which means you must sell the stock before buying again.
After you sell your stock, you cannot buy stock on the immediately following day due to a cooldown of $1$ day.

Constraints:

• $1 \leq$ prices.length $\leq 5000$

• $0 \leq$ prices[i] $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.