You are given an integer array, prices, where prices[i] is the price of a stock on the $i^{th}$ day.

You may not hold more than one share at a time, and you must sell your stock before you can buy again. However, you can sell and buy the stock multiple times on the same day, as long as you never hold more than one share at any moment.

Find the maximum profit you can achieve by completing as many transactions as you like (i.e., buying one and selling one share of the stock multiple times).

Constraints:

• $1 \leq$ prices.length $\leq 3 \times 10^3$

• $0 \leq$ prices[i] $\leq 10^4$

Let’s take a moment to make sure that 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.